A trie-based APRIORI implementation for mining frequent item sequences

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2005, Pages 56-65

  Bodon, Ferenc ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

APRIORI algorithm; frequent item sequence mining; trie

Indexed keywords

APRIORI; APRIORI ALGORITHMS; BRANCH PREDICTION; FREQUENT ITEMS; FREQUENT ITEMSET MINING; MEMORY HIERARCHY; MODERN PROCESSORS; PREFETCHING; SEQUENCE MINING; TRANSACTIONAL DATABASE;

ALGORITHMS; DATA STRUCTURES;

DATA MINING;

EID: 77953555466     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133905.1133913     Document Type: Conference Paper

References (19)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. The International Conference on Very Large Databases, pages 487-499, 1994.
2. R. Agrawal and R. Srikant. Mining sequential patterns. In P. S. Yu and A. L. P. Chen, editors, Proc. 11th Int. Conf. Data Engineering, ICDE, pages 3-14. IEEE Press, 6-10 1995.
3. F. Bodon. A fast apriori implementation. In B. Goethals and M. J. Zaki, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), volume 90 of CEUR Workshop Proceedings, Melbourne, Florida, USA, 2003.
4. F. Bodon. Surprising results of trie-based fim algorithms. In B. Goethals, M. J. Zaki, and R. Bayardo, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'04), volume 126 of CEUR Workshop Proceedings, Brighton, UK, 2004.
5. F. Bodon and L. Schmidt-Thieme. The relation of closed itemset mining, complete pruning strategies and item ordering in apriori-based fim algorithms. In Proceedings of the 9th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'05), Porto, Portugal, 2005.
6. C. Borgelt. Efficient implementations of apriori and eclat. In B. Goethals and M. J. Zaki, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), volume 90 of CEUR Workshop Proceedings, Melbourne, Florida, USA, 2003.
7. A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, Y.-K. C. A. Nguyen, and P. Dubey. Cache-conscious frequent pattern mining on a modern processor. In Proceedings of the 31st International Conference on Very Large Date Bases (VLDB'05), Trondheim, Norway, 2005.
8. B. Goethals and M. J. Zaki. Advances in frequent itemset mining implementations: Introduction to fimi03. In B. Goethals and M. J. Zaki, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), volume 90 of CEUR Workshop Proceedings, Melbourne, Florida, USA, 2003.
9. K. Hatonen, M. Klemettinen, H. Mannila, P. Ronkainen, and H. Toivonen. Knowledge discovery from telecommunication network alarm databases. In S. Y. W. Su, editor, Proceedings of the twelfth International Conference on Data Engineering, February 26-March 1, 1996, New Orleans, Louisiana, pages 115-122, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1996. IEEE Computer Society Press.
10. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery, pages 13-23. Springer-Verlag, 2000.
11. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of the first IEEE International Conference on Data Mining, pages 313-320, 2001.
12. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In Proceedings of the First International Conference on Knowledge Discovery and Data Mining, pages 210-215. AAAI Press, 1995.
13. J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proceedings of the 17th International Conference on Data Engineering, pages 215-224, Washington, DC, USA, 2001. IEEE Computer Society.
14. A. Pietracaprina and D. Zandolin. Mining frequent itemsets using patricia tries. In B. Goethals and M. J. Zaki, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), volume 90 of CEUR Workshop Proceedings, Melbourne, Florida, USA, 2003.
15. B. Rácz. nonordfp: An FP-growth variation without rebuilding the FP-tree. In B. Goethals, M. J. Zaki, and R. Bayardo, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'04), volume 126 of CEUR Workshop Proceedings, Brighton, UK, 2004.
16. B. Rácz, F. Bodon, and L. Schmidt-Thieme. On benchmarking frequent itemset mining algorithms: from measurement to analysis. In B. Goethals, S. Nijssen, and M. J. Zaki, editors, Proceedings of the ACM SIGKDD Workshop on Open Source Data Mining on Frequent Pattern Mining Implementations, Chicago, IL, USA, 2005.
17. L. Schmidt-Thieme. Algorithmic features of eclat. In B. Goethals, M. J. Zaki, and R. Bayardo, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'04), volume 126 of CEUR Workshop Proceedings, Brighton, UK, 2004.
18. H. Toivonen. Sampling large databases for association rules. In The VLDB Journal, pages 134-145, 1996.
19. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2:Efficient mining algorithms for frequent/closed/maximal itemsets. In B. Goethals, M. J. Zaki, and R. Bayardo, editors, Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'04), volume 126 of CEUR Workshop Proceedings, Brighton, UK, 2004.