An improvised frequent pattern tree Based association rule mining Technique with mining frequent item Sets algorithm and a modified header Table

Agarwal, Vandit and Kushal, Mandhani and Kumar, Preetham (2015) An improvised frequent pattern tree Based association rule mining Technique with mining frequent item Sets algorithm and a modified header Table. International Journal of Data Mining & Knowledge Management Process, 5 (2). pp. 39-51.

[img] PDF
5215ijdkp04.pdf - Published Version
Restricted to Registered users only

Download (279kB) | Request a copy

Abstract

In today’s world there is a wide availability of huge amount of data and thus there is a need for turning this data into useful information which is referred to as knowledge. This demand for knowledge discovery process has led to the development of many algorithms used to determine the association rules. One of the major problems faced by these algorithms is generation of candidate sets. The FP-Tree algorithm is one of the most preferred algorithms for association rule mining because it gives association rules without generating candidate sets. But in the process of doing so, it generates many CP-trees which decreases its efficiency. In this research paper, an improvised FP-tree algorithm with a modified header table, along with a spare table and the MFI algorithm for association rule mining is proposed. This algorithm generates frequent item sets without using candidate sets and CP-trees

Item Type: Article
Uncontrolled Keywords: Association rules; FP-tree; Modified header table; Frequent Item Set; Frequent Pattern Tree
Subjects: Engineering > MIT Manipal > Information and Communication Technology
Depositing User: MIT Library
Date Deposited: 09 Apr 2015 09:43
Last Modified: 09 Apr 2015 09:43
URI: http://eprints.manipal.edu/id/eprint/142389

Actions (login required)

View Item View Item