Advertisement

Non-recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations

  • Mohammad El-Hajj
  • Osmar R. Zaïane
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2737)

Abstract

Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. One major problem is the high memory dependency: gigantic data structures built are assumed to fit in main memory; in addition, the recursive mining process to mine these structures is also too voracious in memory resources. This paper proposes a new association rule-mining algorithm based on frequent pattern tree data structure. Our algorithm does not use much more memory over and above the memory used by the data structure. For each frequent item, a relatively small independent tree called COFI-tree, is built summarizing co-occurrences. Finally, a simple and non-recursive mining process mines the COFI-trees. Experimental studies reveal that our approach is efficient and allows the mining of larger datasets than those limited by FP-Tree

Keywords

Association Rule Frequent Pattern Association Rule Mining Frequent Item Support Threshold 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwal, R., Aggarwal, C., Prasad, V.: A tree projection algorithm for generation of frequent itemsets. Parallel and distributed Computing (2000)Google Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases, Santiago, Chile, pp. 487–499 (September 1994)Google Scholar
  3. 3.
    IBM. Almaden. Quest synthetic data generation code, http://www.almaden.ibm.com/cs/quest/syndata.html
  4. 4.
  5. 5.
    Han, E.-H., Karypis, G., Kumar, V.: Scalable parallel data mining for association rule. Transactions on Knowledge and data engineering 12(3), 337–352 (2000)CrossRefGoogle Scholar
  6. 6.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: ACM-SIGMOD, Dallas (2000)Google Scholar
  7. 7.
    Huang, H., Wu, X., Relue, R.: Association analysis with one scan of databases. In: IEEE International Conference on Data Mining, pp. 629–636 (December 2002)Google Scholar
  8. 8.
    Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by oppotunistic projection. In: Eight ACM SIGKDD Internationa Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, pp. 229–238 (August 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Mohammad El-Hajj
    • 1
  • Osmar R. Zaïane
    • 1
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada

Personalised recommendations