Fast algorithm for mining minimal generators of frequent closed itemsetsand their applications Vo B., Le B. Faculty of Information Technology, Ho Chi Minh City University of Technology, Vietnam, Viet Nam; Faculty of Information Technology, University of Science, Ho Chi Minh City, Vietnam, Viet Nam Abstract: The number of frequent closed itemsets (FCIs) are usually fewer thannumbers of frequent itemsets. However, it is necessary to find MinimalGenerators (mGs) for mining association rule from them. The finding mGsapproaches based on generating candidate lose timeliness when the number offrequent closed itemsets are large. In this paper, we present MG-CHARM, anefficient algorithm for finding all mGs of frequent closed itemsets. Based onthe mGs properties mentioned in section 2.4, we develop an algorithm which doesnot generate candidates by mining directly the mGs of frequent closed itemsetsat mining FCIs. Thus, the time for finding mGs of frequent closed itemsets isinsignificant. Experiment shows that the time of MG-CHARM is fewer than the timeof finding mGs after finding all closed itemsets (CHARM), especially in case ofthe the length of each frequent closed itemset is long. We also presentapplications of mGs for mining (minimal) non-redundant association rules. ©2009 IEEE. Author Keywords: Frequent closed itemset; MG-CHARM; Minimal generators; Non- redundantassociation rules Index Keywords: Closed itemsets; Fast algorithms; Frequent closed itemsets; Frequent Itemsets; MGCHARM; Minimal generators; Mining association rules; Non- redundantassociation rules; Association rules; Associative processing; Industrial engineering; Algorithms Year: 2009 Source title: 2009 International Conference on Computers and Industrial Engineering, CIE 2009 Art. No.: 5223846 Page : 1407-1411 Link: Scorpus Link Correspondence Address: Vo, B.; Faculty of Information Technology, Ho Chi Minh City University of Technology, Vietnam, Viet Nam; email:
[email protected] Conference name: 2009 International Conference on Computers and Industrial Engineering, CIE 2009 Conference date: 6 July 2009 through 9 July 2009 Conference location: Troyes Conference code: 81546 ISBN: 9.78142E+12 Language of Original Document: English Abbreviated Source Title: 2009 International Conference on Computers and Industrial Engineering, CIE 2009 Document Type: Conference Paper Source: Scopus
Authors with affiliations: 1. Vo, B., Faculty of Information Technology, Ho Chi Minh City University of Technology, Vietnam, Viet Nam 2. Le, B., Faculty of Information Technology, University of Science, Ho Chi Minh City, Vietnam, Viet Nam
References: 1.
Agrawal, R., Srikant, R., Fast algorithms for mining association rules (1994) VLDB'94
2.
Agrawal, R., Imielinski, T., Swami, A., Mining association rules between sets of items in large databases (1993) SIGMOD'93, pp. 207-216
3.
Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L., Mining Minimal Non-Redundant Association Rules using Closed FrequentItemssets (2000) 1st International Conference on Computational Logic, pp. 972-986
4.
Zaki, M.J., Hsiao, C.J., Efficient algorithms for mining closed itemsets and their latticestructure (2005) IEEE Transactions on Knowledge and Data Engineering, 17 (4), pp. 462-478. , April 2005
5.
Zaki, M.J., Mining non-redundant association rules (2004) Data Mining and Knowledge Discovery, 9, pp. 223-248. , 223248, 2004 Kluwer Academic Publishers. Manufactured in The Netherlands
6.
Zaki, M.J., Gouda, K., Fast vertical mining using dijfsets (2003) Proc. Ninth ACM SIGKDD Inťl Conf. Knowledge Discovery and DataMining, pp. 326-335
7.
Zaki, M.J., Phoophakdee, B., MIRAGE: A framework for mining exploring and visualizing minimalassociation rules (2003) Technical Report 03-4, , Computer Science Dept., Rensselaer Polytechnic Inst. July
8.
Zaki, M.J., Generating non-redundant association rules (2000) 6th ACM SIGKDD Intl Conf Knowledge Discovery and Data Mining
9.
Zaki, M.J., Ogihana, M., Theoretical foundations of association rules (1998) 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and KnowledgeDiscovery
10. Yahia, S.B., Hamrouni, T., Nguifo, E.M., Frequent closed itemset based algorithms: A thorough structural andanalytical survey (2006) ACM SIGKDD Explorations Newsletter, 8 (1), pp. 93-104
