Mining N-most Interesting Itemsets

  • Wai-chee Fu A
  • Wang-wai Kwong R
  • Tang J
N/ACitations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Previous methods on mining association rules require users to input a minimum support threshold. However, there can be too many or too few resulting rules if the threshold is set inappropriately. It is difficult for end-users to find the suitable threshold. In this paper, we propose a different setting in which the user does not provide a support threshold, but instead indicates the amount of results that is required.

Cite

CITATION STYLE

APA

Wai-chee Fu, A., Wang-wai Kwong, R., & Tang, J. (2000). Mining N-most Interesting Itemsets (pp. 59–67). https://doi.org/10.1007/3-540-39963-1_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free