DBV-Miner: A Dynamic Bit-Vector approach for fast mining frequent closed itemsets

Expert Systems with Applications

Volumn 39, Issue 8, 2012, Pages 7196-7206

  Vo, Bay ^a   Hong, Tzung Pei ^b,c   Le, Bac ^d  

^a HO CHI MINH CITY UNIVERSITY OF TECHNOLOGY   (Viet Nam)

^b NATIONAL UNIVERSITY OF KAOHSIUNG   (Taiwan)

^c NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^d UNIVERSITY OF NATURAL SCIENCES   (Viet Nam)

Author keywords

BitTable; Data mining; Dynamic Bit Vector; Frequent closed itemsets; Vertical data format

Indexed keywords

BITTABLE; COMPUTING TIME; DATA FORMAT; FIXED SIZE; FREQUENT CLOSED ITEMSETS; ITEM SETS; LOOK UP TABLE; MEMORY USAGE; MINING FREQUENT ITEMSETS; REDUNDANT RULES; TRANSACTION DATABASE;

ALGORITHMS; DATA MINING; DATABASE SYSTEMS; FAST RESPONSE COMPUTER SYSTEMS;

VECTORS;

EID: 84857651217     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2012.01.062     Document Type: Article

References (27)

1. Agrawal, R.; & Srikant, R. (1994). Fast algorithms for mining association rules. In VLDB'94 (pp. 487-499).
2. Bastide, Y.; Pasquier, N.; Taouil, R.; Stumme, & G.; Lakhal, L. (2000). Mining minimal non-redundant association rules using frequent closed itemsets. In First international conference on computational logic (pp. 972-986).
3. J. Dong, and M. Han BitTable-FI: An efficient mining frequent itemsets algorithm Knowledge Based Systems 20 4 2007 329 335
4. G. Grahne, and J. Zhu Fast algorithms for frequent itemset mining using fp-trees IEEE Transactions on Knowledge and Data Engineering 17 10 2005 1347 1362
5. T.-P. Hong, C.-W. Lin, and Y.-L. Wu Maintenance of fast updated frequent pattern trees for record deletion Computational Statistics and Data Analysis 53 7 2009 2485 2499
6. T.-P. Hong, and C.-J. Wang An efficient and effective association-rule maintenance algorithm for record modification Expert Systems with Applications 37 1 2010 618 626
7. T.-P. Hong, Y.-Y. Wu, and S.-L. Wang An effective mining approach for up-to-date patterns Expert Systems with Applications 36 6 2009 9747 9752
8. A.J.T. Lee, C.S. Wang, W.Y. Weng, J.A. Chen, and H.W. Wu An efficient algorithm for mining closed inter-transaction itemsets Data and Knowledge Engineering 66 1 2008 68 91
9. C.-W. Lin, T.-P. Hong, and W.-H. Lu The Pre-FUFP algorithm for incremental mining Expert Systems with Applications 36 5 2009 9498 9505
10. B. Lucchese, S. Orlando, and R. Perego Fast and memory efficient mining of frequent closed itemsets IEEE Transaction on Knowledge and Data Engineering 18 1 2006 21 36
11. Moonestinghe, H. D. K.; Fodeh, S.; & Tan, P. N. (2006). Frequent closed itemsets mining using prefix graphs with an efficient flow-based pruning strategy. In Proceedings of 6th ICDM, Hong Kong (pp. 426-435).
12. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal Discovering frequent closed itemsets for association rules Proceedings of the 5th international conference on database theory. LNCS 1999 Springer Jerusalem, Israel 398 416
13. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal Efficient mining of association rules using closed itemset lattices Information Systems 24 1 1999 25 46
14. Pei, J.; Han, J.; & Mao, R. (2000). CLOSET: An efficient algorithm for mining frequent closed itemsets. In Proceedings of the 5th ACM-SIGMOD workshop on research issues in data mining and knowledge discovery, Dallas, Texas, USA (pp. 11-20).
15. Singh, N. G.; Singh, S. R.; & Mahanta, A.K. (2005). CloseMiner: Discovering frequent closed itemsets using frequent closed tidsets. In Proceedings of the 5th ICDM, Washington DC, USA (pp. 633-636).
16. W. Song, B. Yang, and Z. Xu Index-BitTableFI: An improved algorithm for mining frequent itemsets Knowledge Based Systems 21 6 2008 507 513
17. T. Uno, T. Asai, Y. Uchida, and H. Arimura An efficient algorithm for enumerating closed patterns in transaction databases Proceedings of the 7th international conference on discovery science. LNCS 2004 Springer Padova, Italy 16 31
18. Vo, B.; & Le, B. (2009). Mining traditional association rules using frequent itemsets lattice. In The 39th international conference on computers and industrial engineering, Troyes, France, July 6-8 (pp. 1401-1406). IEEE.
19. B. Vo, and B. Le Interestingness measures for mining association rules: Combination between lattice and hash tables Expert Systems with Applications 38 9 2011 11630 11640
20. B. Vo, and B. Le Mining minimal non-redundant association rules using frequent itemsets lattice Journal of Intelligent Systems Technology and Applications 10 1 2011 92 206
21. Wang, J.; Han, J.; & Pei, J. (2003). CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In ACM SIGKDD international conference on knowledge discovery and data mining (pp. 236-245).
22. S.B. Yahia, T. Hamrouni, and E.M. Nguifo Frequent closed itemset based algorithms: a thorough structural and analytical survey ACM SIGKDD Explorations Newsletter 8 1 2006 93 104
23. Zaki, M. J. (2000). Generating non-redundant association rules. In Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, Massachusetts, Boston, USA (pp. 34-43).
24. M.J. Zaki Mining non-redundant association rules Data Mining and Knowledge Discovery 9 3 2004 223 248
25. Zaki, M. J.; Parthasarathy, S.; Ogihara, M.; & Li, W. (1997). New algorithms for fast discovery of association rules. In: Third international conference on knowledge discovery and data mining (KDD) (pp. 283-286).
26. M.J. Zaki, and C.J. Hsiao Efficient algorithms for mining closed itemsets and their lattice structure IEEE Transactions on Knowledge and Data Engineering 17 4 2005 462 478
27. S. Zhang, J. Zhang, and Z. Jin A decremental algorithm of frequent itemset maintenance for mining updated databases Expert Systems with Applications 36 8 2009 10890 10895