DocumentCode :
1636912
Title :
Efficient Mining of Frequent Closed Itemsets without Closure Checking
Author :
Lee, Chih-Hsien ; Yang, Don-Lin ; Wu, Jungpin ; Yin, Kuo-Cheng
Author_Institution :
Dept. of Inf. Eng. & Comput. Sci., Feng Chia Univ., Taichung
Volume :
3
fYear :
2008
Firstpage :
269
Lastpage :
274
Abstract :
Most existing algorithms for mining frequent closed itemsets have to check whether a newly generated itemset is a frequent closed itemset by using the subset checking technique. To do this, a storing structure is required to keep all known frequent itemsets and candidates. It takes additional processing time and memory space for closure checking. To remedy this problem, an efficient approach called closed itemset mining with no closure checking algorithm is proposed. We use the information recorded in a FP-tree to identify the items that will not constitute closed itemsets. Using this information, we can generate frequent closed itemsets directly. It is no longer necessary to check whether an itemset is closed or not when it is generated. We have implemented our algorithm and made many performance experiments. The results show that our approach has better performance in the runtime and memory space utilization. Moreover, this approach is also suitable for parallel mining of frequent closed itemsets.
Keywords :
data mining; tree data structures; FP-tree; frequent closed itemset mining; storing structure; subset checking technique; Application software; Association rules; Computer science; Data mining; Design engineering; Frequency; Intelligent systems; Itemsets; Public finance; Statistics; Association rule; closed itemset; closure checking; data mining;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems Design and Applications, 2008. ISDA '08. Eighth International Conference on
Conference_Location :
Kaohsiung
Print_ISBN :
978-0-7695-3382-7
Type :
conf
DOI :
10.1109/ISDA.2008.46
Filename :
4696473
Link To Document :
بازگشت