(Publisher of Peer Reviewed Open Access Journals)

International Journal of Advanced Computer Research (IJACR)

ISSN (Print):2249-7277    ISSN (Online):2277-7970
Volume-4 Issue-14 March-2014
Full-Text PDF
Paper Title : Efficient Frequent Pattern Tree Construction
Author Name : D.Bujji Babu, R.Siva Rama Prasad, Y.Umamaheswararao
Abstract :

Association rule learning is a popular and well researched technique for discovering interesting relations between variables in large databases in the area of data mining. The association rules are a part of intelligent systems. Association rules are usually required to satisfy a user-specified minimum support and a user-specified minimum confidence at the same time. Apriori and FP-Growth algorithms are very familiar algorithms for association rule mining. In this paper we are more concentrated on the Construction of efficient frequent pattern trees. Here, we present the novel frequent pattern trees and the performance issues. The proposed trees are fast and efficient trees helps to extract the frequent patterns. This paper provides the major advantages in the FP-Growth algorithm for association rule mining with using the newly proposed approach.

Keywords : Data mining, Association rule, frequent item set, frequent item, support.
Cite this article : D.Bujji Babu, R.Siva Rama Prasad, Y.Umamaheswararao , " Efficient Frequent Pattern Tree Construction " , International Journal of Advanced Computer Research (IJACR), Volume-4, Issue-14, March-2014 ,pp.331-336.