Index-BitTableFI: An improved algorithm for mining frequent itemsets

Knowledge-Based Systems

Volumn 21, Issue 6, 2008, Pages 507-513

  Song, Wei ^a   Yang, Bingru ^b   Xu, Zhangyan ^c  

^a NORTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^c GUANGXI NORMAL UNIVERSITY   (China)

Author keywords

Association rule; BitTable; Data mining; Frequent itemset; Index array; Subsume index

Indexed keywords

ALGORITHMS; ASSOCIATIVE PROCESSING; BOOLEAN FUNCTIONS; DATA MINING; DECISION SUPPORT SYSTEMS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; SEARCH ENGINES;

BIT WISE OPERATIONS; BREADTH-FIRST SEARCH (BFS); CANDIDATE GENERATION; CO-OCCURRENCE; COMPUTING METHODS; DATA MINING TASKS; DATA-SETS; DEPTH-FIRST SEARCH (DFS); EFFICIENT ALGORITHMS; FREQUENT ITEMSETS; HYBRID SEARCH; IMPROVED ALGORITHM; ITEMSETS; MINING ASSOCIATION RULES; MINING FREQUENT ITEMSETS; NEW ALGORITHM; SEARCH SPACES;

MINING;

EID: 48649099292     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2008.03.011     Document Type: Article

References (25)

1. R. Agrawal, T. Imielinski, A. Swami, Mining associations between sets of items in massive databases, in: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (SIGMOD'93), Washington, DC, 1993, pp. 207-216.
2. R. Agrawal, R. Srikant, Fast algorithms for mining association rules in large databases, in: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94), Chile, 1994, pp. 487-499.
3. R. Agrawal, R. Srikant, Mining sequential patterns, in: Proceedings of the Eleventh International Conference on Data Engineering (ICDE'95), Taipei, 1995, pp. 3-14.
4. Mannila H., Toivonen H., and Verkamo A.I. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1 3 (1997) 259-289
5. Inokuchi A., Washio T., and Motoda H. Complete mining of frequent patterns from graphs: mining graph data. Machine Learning 50 3 (2003) 321-354
6. J.S. Park, M.S. Chen, P.S. Yu, An efficient hash-based algorithm for mining association rules, in: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (SIGMOD'95), San Jose, California, 1995, pp. 175-186.
7. A. Savasere, E. Omiecinski, S.B. Navathe, An efficient algorithm for mining association rules in large databases, in: Proceedings of 21th International Conference on Very Large Data Bases (VLDB'95), Zurich, 1995, pp. 432-444.
8. H. Toivonen, Sampling large databases for association rules, in: Proceedings of 22th International Conference on Very Large Data Bases (VLDB'96), Bombay, India, 1996, pp. 134-145.
9. S. Brin, R. Motwani, J.D. Ullman, S. Tsur, Dynamic itemset counting and implication rules for market basket data, in: Proceedings ACM SIGMOD International Conference on Management of Data (SIGMOD'97), Tucson, Arizona, 1997, pp. 255-264.
10. Fong J., Wong H.K., and Huang S.M. Continuous and incremental data mining association rules using frame metadata model. Knowledge Based Systems 16 2 (2003) 91-100
11. S. Sarawagi, S. Thomas, R. Agrawal, Integrating mining with relational database systems: alternatives and implications, in: Proceedings ACM SIGMOD International Conference on Management of Data (SIGMOD'98), Seattle, Washington, 1998, pp. 343-354.
12. S. Orlando, P. Palmerini, R. Perego, Enhancing the Apriori algorithm for frequent set counting, in: Proceedings of Third International Conference on Data Warehousing and Knowledge Discovery (DaWak'01), Munich, 2001, pp. 71-82.
13. Tsay Y.J., and Chiang J.Y. CBAR: an efficient method for mining association rules. Knowledge Based Systems 18 2-3 (2005) 99-105
14. J. Han, J. Pei, Y. Yin, Mining frequent patterns without candidate generation, in: Proceedings of the 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD'00), Dallas, Texas, 2000, pp. 1-12.
15. J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, D. Yang, H-Mine: hyper-structure mining of frequent patterns in large databases, in: Proceedings of the 2001 IEEE International Conference on Data Mining (ICDM'01), San Jose, CA, 2001, pp. 441-448.
16. Liu G., Lu H., Lou W., Xu Y., and Yu J.X. Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Mining Knowledge Discovery 9 3 (2004) 249-274
17. Grahne G., and Zhu J. Fast algorithms for frequent itemset mining using FP-Trees. IEEE Transaction on Knowledge and Data Engineering 17 10 (2005) 1347-1362
18. Zaki M.J. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering 12 3 (2000) 372-390
19. M.J. Zaki, K. Gouda, Fast vertical mining using diffsets, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, 2003, pp. 326-335.
20. Dong J., and Han M. BitTableFI: an efficient mining frequent itemsets algorithm. Knowledge Based Systems 20 4 (2007) 329-335
21. B. Goethals, M.J. Zaki, Advances in frequent itemset mining implementations introduction to FIMI03, in: Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations (FIMI'03), 2003.
22. Yun U. Mining lossless closed frequent patterns with weight constraints. Knowledge Based Systems 20 1 (2007) 86-97
23. Srikumar K., and Bhasker B. Metamorphosis: mining maximal frequent sets in dense domains. International Journal on Artificial Intelligence Tools 14 3 (2005) 491-505
24. J. Liu, S. Paulsen, X. Sun, W. Wang, A.B. Nobel, J. Prins, Mining approximate frequent itemsets in the presence of noise: algorithm and analysis, in: Proceedings of 2006 SIAM International Conference on Data Mining (SDM'06), Bethesda, MD, 2006, pp. 405-416.
25. Calders T., and Goethals B. Non-derivable itemset mining. Data Mining and Knowledge Discovery 14 1 (2007) 171-206