An Improved FP-Growth Algorithm Based on Compound Single Linked List

Author

Zhenguo, Ding ; Qinqin, Wei ; Xianhua, Ding

Author_Institution

Sch. of Comput. Sci. & Technol., Xidian Univ., Xi´´an, China

Volume

1

fYear

2009

fDate

21-22 May 2009

Firstpage

351

Lastpage

353

Abstract

FP-growth algorithm is one of the most efficient approaches for frequent item set mining. In this article, an improved FP-growth algorithm based on Compound Single Linked List is proposed. There are two contributions in the new algorithm. One is to use the sequencing table and single linked list as the main data structure, the other is that it does not need to generate conditional FP-tree. An experiment is conducted to compare the efficiency between the original one and the improved one. It shows that the new one improves the algorithm both in runtime and the main memory consumption.

Keywords

data mining; tree data structures; FP-growth algorithm; compound single linked list; conditional FP-tree; data structure; frequent item set mining; main memory consumption; Association rules; Computer science; Costs; Data mining; Data structures; Information technology; Itemsets; Partitioning algorithms; Runtime; Transaction databases; FP-growth; association rules; compound single linked list;

fLanguage

English

Publisher

ieee

Conference_Titel

Information and Computing Science, 2009. ICIC '09. Second International Conference on

Conference_Location

Manchester

Print_ISBN

978-0-7695-3634-7

Type

conf

DOI

10.1109/ICIC.2009.96

Filename

5169613