DocumentCode
2572810
Title
Frequent itemsets mining algorithm based on node linked list FP-Tree
Author
Liu, Shangli ; Yang, Qing
Author_Institution
Network Inf. Center, Hunan Univ. of Sci. & Technol., Xiangtan, China
fYear
2011
fDate
27-29 June 2011
Firstpage
1297
Lastpage
1299
Abstract
Aiming at the problem of low efficiencies for frequent item sets mining based on FP-Tree, which need a great lot of recursion call. This paper proposes another mining algorithm which uses a improved data structure named node linked list FP Tree (NLFP-Tree). NLFP-Tree compresses the FP-Tree greatly by record the node´s prefix path using node linked list. And mines frequent item sets by bottom-to-up and non-recursion method. Experimental results show that the mining algorithm performs better than Apriori, FP-Growth.
Keywords
data mining; tree data structures; NLFP-Tree; bottom-to-up method; data structure; frequent itemsets mining algorithm; node linked list FP-tree; nonrecursion method; recursion call; Algorithm design and analysis; Computers; Conferences; Data mining; Itemsets; Java; Presses; association rules; data mining; fp-tree; frequent itemset; linked list;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Service System (CSSS), 2011 International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-9762-1
Type
conf
DOI
10.1109/CSSS.2011.5972068
Filename
5972068
Link To Document