Mining minimal non-redundant association rules using frequent itemsets lattice

International Journal of Intelligent Systems Technologies and Applications

Volumn 10, Issue 1, 2011, Pages 92-106

  Vo, Bay ^a   Le, Bac ^b  

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

^b UNIVERSITY OF NATURAL SCIENCES   (Viet Nam)

Author keywords

FIL; Frequent closed itemsets; Frequent itemsets lattice; MGs; Minimal generators; Minimal non redundant association rules; MNARs

Indexed keywords

EID: 79955593191     PISSN: 17408865     EISSN: 17408873     Source Type: Journal    
DOI: 10.1504/IJISTA.2011.038265     Document Type: Article

References (24)

1. Agrawal, R. and Srikant, R. (1994) 'Fast algorithms for mining association rules', VLDB'94, pp.487-499.
2. Bastide, Y., Pasquier, N., Taouil, R., Stumme, G. and Lakhal, L. (2000) 'Mining minimal nonredundant association rules using frequent closed itemsets', 1st International Conference on Computational Logic, pp.972-986.
3. Bay, V. and Bac, L. (2009) 'Mining traditional association rules using frequent itemsets lattice', 39th International Conference on CIE, 6-8 July, Troyes, France: IEEE published.
4. Choi, V. (2006) Faster Algorithms for Constructing a Concept (Galois) Lattice, arXiv:cs.DM/0602069.
5. Grahne, G. and Zhu, J. (2003) 'Efficiently using prefix-trees in mining frequent itemsets', FIMI'03 Workshop on Frequent Itemset Mining Implementations (held with IEEE ICDM'03), pp.123-132.
6. Grahne, G. and Zhu, J. (2005) 'Fast algorithms for frequent itemset mining using FP-trees', IEEE Transactions on Knowledge Data Engineering, Vol. 17, No. 10, pp.1347-1362. (Pubitemid 41560422)
7. Han, J. and Kamber, M. (2006) Data Mining: Concept and Techniques (2nd ed.). Sansome Street, San Francisco, CA, USA: Morgan Kaufmann Publishers, pp.239-241.
8. Kourie, D.G., Obiedkov, S., Watson, B.W. and Merwe, D.V.D. (2009) 'An incremental algorithm to construct a lattice of set intersections', Science of Computer Programming, Vol. 74, pp.128-142.
9. Kuznetsov, S.O. and Obiedkov, S.A. (2002) 'Comparing performance of algorithms for generating concept lattices', Journal of Experimental and Theoretical Artificial Intelligence, Vol. 14, Nos. 2-3, pp.189-216. (Pubitemid 36012653)
10. Lee, A.J.T., Wang, C.S., Weng, W.Y., Chen, J.A. and Wu, H.W.(2008) 'An efficient algorithm for mining closed inter-transaction itemsets', Data and Knowledge Engineering, Vol. 66, pp.68-91. (Pubitemid 351749495)
11. Li, J. (2006) 'On optimal rule discovery', IEEE Transactions on Knowledge and Data Engineering, Vol. 18, No. 4, April, pp.460-471. (Pubitemid 43327096)
12. Lucchese, B., Orlando, S. and Perego, R. (2006) 'Fast and memory efficient mining of frequent closed itemsets', IEEE Transaction on Knowledge and Data Engineering, Vol. 18, No. 1, pp.21-36. (Pubitemid 43145086)
13. Moonestinghe, H.D.K., Fodeh, S. and Tan, P.N. (2006) 'Frequent closed itemsets mining using prefix graphs with an efficient flow-based pruning strategy', Proceedings of 6th ICDM, Hong Kong, pp.426-435.
14. Pasquier, N., Bastide, Y., Taouil, R. and Lakhal, L. (1999a) 'Discovering frequent closed itemsets for association rules', Proceedings of the 5th International Conference on Database Theory, LNCS, Springer-Verlag, Jerusalem, Israel, pp.398-416.
15. Pasquier, N., Bastide, Y., Taouil, R. and Lakhal, L. (1999b) 'Efficient mining of association rules using closed itemset lattices', Information Systems, Vol. 24, No. 1, pp.25-46.
16. Pei, J., Han, J. and Mao, R. (2000) 'CLOSET: an efficient algorithm for mining frequent closed itemsets', Proceedings of the 5th ACM-SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, USA, pp.11-20.
17. Shuqun, Y., Shuliang, D., Shengzen, C. and Qiulin, D. (2008) 'An algorithm of constructing concept lattices for CAT with cognitive', Knowledge-Based Systems, Vol. 21, pp.852-855.
18. Singh, N.G., Singh, S.R. and Mahanta, A.K. (2005) 'Close Miner: discovering frequent closed itemsets using frequent closed tidsets', Proceedings of the 5th ICDM, Washington, DC, USA, pp.633-636. (Pubitemid 47385758)
19. Uno, T., Asai, T., Uchida, Y. and Arimura, H. (2004) 'An efficient algorithm for enumerating closed patterns in transaction databases', Proceedings of the 7th International Conference on Discovery Science, LNCS, Springer Verlag, Padova, Italy, pp.16-31. (Pubitemid 39745449)
20. Wang, J., Han, J. and Pei, J. (2003) 'CLOSET+: searching for the best strategies for mining frequent closed itemsets', ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.236-245.
21. Zaki, M.J. (2000) 'Generating non-redundant association rules', Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Boston, Massachusetts, USA, pp.34-43.
22. Zaki, M.J. (2004) Mining Non-redundant Association Rules, Data Mining and Knowledge Discovery. Hingham, MA, USA: Kluwer Academic Publishers, pp.223-248.
23. Zaki, M.J. and Hsiao, C.J. (2005) 'Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure', IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No 4, April 2005, pp.462-478. (Pubitemid 40495590)
24. Yahia, S.B., Hamrouni, T. and Nguifo, E.M. (2006) 'Frequent closed itemset based algorithms: a thorough structural and analytical survey', ACM SIGKDD Explorations Newsletter, Vol. 8, No. 1, pp.93-104.