A study on FP Tree Algorithms for Association Rules
Main Article Content
Abstract
A study on the performance of the FP growth method shows that it is efficient and scalable for mining both long and short frequent
patterns, and is about an order of magnitude faster than Apriori algorithm. The frequent pattern tree structure, which is an extended prefix tree
structure for storing compressed, crucial information about frequent pattern and develop an efficient FP-tree, based mining method. Efficiency of
mining is achieved with three techniques: (1) a large database is compressed into a smaller data structure; FP-tree avoids costly, repeated
database scans, (2) our FP-tree-based mining avoids the costly generation of a large number of candidate sets, and (3) The FP-tree algorithm
avoid repeated scan of database and search database in divide-and-conquer based. We also perform an evaluation study of the hiding algorithms
in order to analyze their time complexity and the impact that they have in the original database.
Â
Â
Keywords: Apriori algorithm, FP-tree algorithm, Frequent Pattern, FP-growth
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.