文章基本信息

标题：Efficient Frequent Pattern Tree Construction
本地全文：下载
作者：D.Bujji Babu ; R.Siva Rama Prasad ; Y.Umamaheswararao 等
期刊名称：International Journal of Advanced Computer Research
印刷版ISSN：2249-7277
电子版ISSN：2277-7970
出版年度：2014
卷号：4
期号：14
页码：331-336
出版社：Association of Computer Communication Education for National Triumph (ACCENT)
摘要：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.
关键词：Data mining; Association rule; frequent item set; frequent item; support.