Memory-efficient frequent-itemset mining

ACM International Conference Proceeding Series

Volumn , Issue , 2011, Pages 461-472

  Schlegel, Benjamin ^a   Gemulla, Rainer ^b   Lehner, Wolfgang ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b MAX PLANCK INSTITUTE   (Germany)

Author keywords

Algorithms; Performance

Indexed keywords

DATA MINING; DATABASE SYSTEMS; TREES (MATHEMATICS);

CORE ALGORITHMS; DATA MINING TASKS; FREQUENT ITEMSET; FREQUENT ITEMSET MINING; LARGE DATASETS; MAIN-MEMORY; MEMORY EFFICIENT; PERFORMANCE; PREFIX TREES; TREE-BASED ALGORITHMS;

DATA STRUCTURES;

EID: 79953879396     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1951365.1951420     Document Type: Conference Paper

References (32)

1. R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. In SIGMOD, pages 207-216, New York, NY, USA, 1993. ACM.
2. R. Agrawal and R. Srikant. Quest synthetic data generator. IBM Almaden Research Center.
3. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487-499, 1994.
4. C. Bienia, S. Kumar, J. P. Singh, and K. Li. The parsec benchmark suite: Characterization and architectural implications. In PACT, October 2008.
5. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254-260, 1999.
6. G. Buehrer, S. Parthasarathy, and A. Ghoting. Out-of-core frequent pattern mining on a commodity pc. In SIGKDD, pages 86-95, New York, NY, USA, 2006. ACM. (Pubitemid 44535506)
7. G. Buehrer, S. Parthasarathy, S. Tatikonda, T. Kurc, and J. Saltz. Toward terabyte pattern mining: an architecture-conscious solution. In PPoPP, pages 2-12, New York, NY, USA, 2007. ACM. (Pubitemid 47479076)
8. Frequent Itemset Mining Implementations Repository: http://fimi.cs. helsinki.fi/.
9. K. Geurts, G. Wets, T. Brijs, and K. Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, Washington DC. (USA), January 12-16, page 18pp, 2003.
10. A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, A. Nguyen, Y.-K. Chen, and P. Dubey. Cache-conscious frequent pattern mining on a modern processor. In VLDB, pages 577-588, 2005. (Pubitemid 43991035)
11. B. Goethals and M. J. Zaki. Advances in frequent itemset mining implementations: report on fimi'03. SIGKDD Explorations, 6(1):109-117, 2004.
12. G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. In FIMI, 2003.
13. J. Han. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2005.
14. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In SIGMOD, pages 1-12, New York, NY, USA, 2000. ACM.
15. D. E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, 1973.
16. E. Li and L. Liu. Optimization of frequent itemset mining on multiple-core processor. In VLDB, pages 1275-1285, 2007.
17. H. Li, Y. Wang, D. Zhang, M. Zhang, and E. Y. Chang. Pfp: parallel fp-growth for query recommendation. In RecSys, pages 107-114, New York, NY, USA, 2008. ACM.
18. G. Liu, H. Lu, and J. X. Yu. Afopt: An efficient implementation of pattern growth approach. In In Proceedings of the ICDM workshop, 2003.
19. C. Lucchese, S. Orlando, R. Perego, and F. Silvestri. Webdocs: a real-life huge transactional dataset. In FIMI, 2004.
20. E. Özkural and C. Aykanat. A space optimization for fp-growth. In FIMI, 2004.
21. A. Pietracaprina and D. Zandolin. Mining frequent itemsets using patricia tries. In FIMI, 2003.
22. J. R. Punin, M. S. Krishnamoorthy, and M. J. Zaki. Web usage mining - languages and algorithms. In In Studies in Classification, Data Analysis, and Knowledge Organization, pages 88-112. Springer-Verlag, 2001.
23. B. Rácz. nonordfp: An fp-growth variation without rebuilding the fp-tree. In FIMI, 2004.
24. H. K. Reghbati. An overview of data compression techniques. IEEE Computer, 14(4):71-75, 1981.
25. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652-686, 1985.
26. Y. G. Sucahyo and R. P. Gopalan. Ct-itl: Efficient frequent item set mining using a compressed prefix tree with pattern growth. In ADC, pages 95-104, 2003.
27. Y. G. Sucahyo and R. P. Gopalan. Ct-pro: A bottom-up non recursive frequent itemset mining algorithm using compressed fp-tree data structure. In FIMI, 2004.
28. H. Toivonen. Sampling large databases for association rules. In VLDB, pages 134-145, San Francisco, CA, USA, 1996. Morgan Kaufmann Publishers Inc.
29. T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms for frequent/closed/maximal itemsets. In FIMI, 2004.
30. J. T.-L. Wang, M. J. Zaki, H. Toivonen, and D. Shasha, editors. Data Mining in Bioinformatics. Springer, 2005.
31. T. Westmann, D. Kossmann, S. Helmer, and G. Moerkotte. The implementation and performance of compressed databases. SIGMOD Record, 29(3):55-67, 2000.
32. M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. Technical report, Rochester, NY, USA, 1997.