By Topic

The Benefits of Using Prefix Tree Data Structure in Multi-Level Frequent Pattern Mining

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mirela Pater ; Department of Computer Science, University of Oradea, Universitatii Str., nr.1, 410087 Oradea, Romania, Phone: 0040-259-436393, Fax: 0040-259-267105, ; Daniela E. Popescu

Finding frequent itemsets is one of the most investigated fields of data mining. In this paper, the horizon of frequent pattern mining is expanded by extending single-level algorithms for mining multi-level frequent patterns. There are presented two algorithms that extract multi-level frequent patterns from databases using two efficient data structures: FP-tree and AFOP-tree, to represent the conditional databases. A comparison study is made between using these data structures and algorithms and Apriori algorithm to reflect their benefits. The compared algorithms are presented together with some experimental data that leads to the final conclusions.

Published in:

2007 2nd International Workshop on Soft Computing Applications

Date of Conference:

21-23 Aug. 2007