Mining N-most Interesting Multi-level Frequent Itemsets without Support Threshold

  • Sorapol Chompaisal
  • Komate Amphawan
  • Athasit Surarerks
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 265)


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.


Association Rules N-most interesting patterns Multi-level frequent itemsets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. IBM Almaden Research Center (1994)Google Scholar
  2. 2.
    Han, J., Pei, J., Yin, Y.: Mining Frequent patterns without candidate generation. SIGMOD Rec. 29(2) (2000)CrossRefGoogle Scholar
  3. 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
  4. 4.
    Lee, Y., Hong, T., Wang, T.: Multi-level fuzzy mining with multiple minimum supports. In: Expert Systems with Applications, pp. 459–468 (2008)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Eavis, T., Zheng, X.: Multi-level frequent pattern mining. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 369–383. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 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
  8. 8.
    Ngan, S., Lam, T., Wong, R., Fu, A.: Mining N-most interesting itemsets without support threshold by the COFI-tree. Int. J. Bus. Intell. Data Mining, 88–106 (2005)CrossRefGoogle Scholar
  9. 9.
    Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k Periodic-Frequent Pattern from Transactional Databases without Support Threshold. In: Papasratorn, B., Chutimaskul, W., Porkaew, K., Vanijja, V. (eds.) IAIT 2009. CCIS, vol. 55, pp. 18–29. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  10. 10.
    Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k regular-frequent itemsets using database partitioning and support extimation. Expert Systems with Applications 39, 1924–1936 (2012)CrossRefGoogle Scholar
  11. 11.
    Amphawan, K., Lenca, P.: Mining top-k frequent-regular patterns based on user-given trade-off between frequency and regularity. In: Papasratorn, B., Charoenkitkarn, N., Vanijja, V., Chongsuphajaisiddhi, V. (eds.) IAIT 2013. CCIS, vol. 409, pp. 1–12. Springer, Heidelberg (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Sorapol Chompaisal
    • 1
  • Komate Amphawan
    • 2
  • Athasit Surarerks
    • 1
  1. 1.ELITE LaboratoryChulalongkorn UniversityBangkokThailand
  2. 2.Computational Innovation LaboratoryBurapha UniverisityChonburiThailand

Personalised recommendations