DocumentCode :
3049793
Title :
A novel method of mining frequent item sets
Author :
Dong Liyan ; Liu Zhaojun ; Shi Mo ; Yan Pengfei ; Tian Zhuo ; Li Zhen
Author_Institution :
Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China
fYear :
2010
fDate :
20-23 June 2010
Firstpage :
173
Lastpage :
178
Abstract :
The aim of mining association rules is to discover the association relationship among the item sets from mass data. In some practical applications, its role is mainly to assist decision-maker. The paper proposes a novel association rule algorithm of mining frequent item sets, which introduces a new data structure and adopts compressed storage tree to improve the run performance of this algorithm. At last, the experiment indicates that the algorithm proposed in this paper has much more advantages in load balance and run time compared with most existing algorithms.
Keywords :
data mining; compressed storage tree; frequent item sets; mining association rules; Application software; Association rules; Automation; Computer science; Data mining; Educational institutions; Frequency; Sparse matrices; Transaction databases; Tree data structures; Association Rules; Data Mining; Frequent Item Sets;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information and Automation (ICIA), 2010 IEEE International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4244-5701-4
Type :
conf
DOI :
10.1109/ICINFA.2010.5512358
Filename :
5512358
Link To Document :
بازگشت