FP-tree approach for mining N-most interesting itemsets

Yin Ling Cheung; Ada Wai Chee Fu

doi:10.1117/12.460253

12 March 2002 FP-tree approach for mining N-most interesting itemsets

Yin Ling Cheung, Ada Wai Chee Fu

Proceedings Volume 4730, Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV; (2002) https://doi.org/10.1117/12.460253
Event: AeroSense 2002, 2002, Orlando, FL, United States

Abstract

In classical association rules mining, a minimum support threshold is assumed to be available for mining frequent itemsets. However, setting such a threshold is typically hard. If the threshold is set too high, nothing will be discovered; and if it is set too low, too many itemsets will be generated, which also implies inefficiency. In this paper, we handle a more practical problem, roughly speaking, it is to mine the N k-itemsets with the highest support for k up to a certain k_max value. We call the results the N-most interesting itemsets. Generally, it is more straightforward for users to determine N and k_max. This approach also provides a solution for an open issue in the problem of subspace clustering. However, with the above problem definition without the support threshold, the subset closure property of the apriori-gen algorithm no longer holds. We propose three new algorithms, LOOPBACK, BOLB, and BOMO, for mining N-most interesting itemsets by variations of the FP-tree approach. Experiments show that all our methods outperform the previously proposed Itemset-Loop algorithm.

Citation Download Citation

Yin Ling Cheung and Ada Wai Chee Fu "FP-tree approach for mining N-most interesting itemsets", Proc. SPIE 4730, Data Mining and Knowledge Discovery: Theory, Tools, and Technology IV, (12 March 2002); https://doi.org/10.1117/12.460253

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available