A new fast algorithm for constructing FP_tree

Author

Wang, Zhenzhou ; Liu, Jiaomin ; Guo, Sheng ; Yang, Lijuan

Author_Institution

Coll. of Electr. Eng., North China Electr. Power Univ., Baoding

fYear

2008

fDate

25-27 June 2008

Firstpage

6153

Lastpage

6156

Abstract

FP-tree is an efficient algorithm for generating frequent item-sets and the present algorithms are all based on FP_tree generally. But the FP_treepsilas generative process needs much time and it needs to scan database twice. In order to improve the efficiency of constructing the FP_tree, a new fast algorithm called Level FP_tree (abbreviate L-FP_tree) was proposed. The algorithm contains two main parts. Firstly, it scans database and generates equivalence classes of each item. Secondly, it deletes the non-frequent items and rewrites the equivalence classes and then constructs the L-FP_tree.

Keywords

data mining; database management systems; equivalence classes; tree data structures; FP_tree generative process; Level FP_tree; database management system; equivalence class; frequent pattern mining; Aerospace engineering; Automation; Computer science; Data mining; Educational institutions; Information science; Intelligent control; Itemsets; Power engineering and energy; Transaction databases; FP_tree; L-FP_tree; equivalence class; frequent pattern;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Conference_Location

Chongqing

Print_ISBN

978-1-4244-2113-8

Electronic_ISBN

978-1-4244-2114-5

Type

conf

DOI

10.1109/WCICA.2008.4592789

Filename

4592789