Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold
Mining multi-level frequent itemsets from transactional database is one of the most important tasks in data mining community. It aims to discover correlation among items with their hierarchical categories under support-confidence values and thresholds. However, it is well-known that the task of providing an appropriate support threshold to mine the most interesting patterns without prior knowledge in advance is very difficult and it is more reasonable to ask the users to specify the number of desired patterns. Therefore, in this paper, we propose an alternative approach to mine the most interesting multi-level frequent patterns without the setting of support threshold, called N-most interesting multi-level frequent pattern mining, where N is the number of desired patterns with the highest support values per each category level. To mine such patterns, an efficient adaptive FP-growth algorithm, called NMLFP, is proposed. Extensive performance studies show that NMLFP has high performance and linearly scalable on the number of desired results.
KeywordsAssociation Rules N-most interesting patterns Multi-level frequent itemsets
Unable to display preview. Download preview PDF.
- 1.Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. IBM Almaden Research Center (1994)Google Scholar
- 3.Han, J., Fu, Y.: Discovery of Multi-Level Association Rules from Large Databases. In: 21st VLDB Conference on Very Large Data Base, Switzerland, pp. 420–431 (1995)Google Scholar
- 5.Hong, T., Huang, T., Chang, C.: Mining Multiple-level Association Rules Based on Pre-large Concepts. In: Data Mining and Knowledge Discover in Real Life Application, pp. 187–200. In Tech (2009)Google Scholar
- 7.Mohammad, E., Osmar, R.: COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation. In: Workshop on Frequent Itemset Mining Implementations (FIMI 2003) in Conjunction with IEEE-ICDM (2003)Google Scholar