ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

An Approach for Finding Frequent Item Set Done By Comparison Based Technique

Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 4)

Publication Date:

Authors : ; ; ;

Page : 996-1001

Keywords : Data mining; Frequent Pattern mining; Support; Min Heap; Data structure;

Source : Downloadexternal Find it from : Google Scholarexternal


Frequent pattern mining has been a focused theme in data mining research for over a decade. Abundant literature has been dedicated to this research and tremendous progress has been made, ranging from efficient and scalable algorithms for frequent itemsets mining in transaction databases to numerous research frontiers, such as sequential pattern mining, structured pattern mining, correlation mining, associative classification, and frequent pattern-based clustering, as well as their broad applications. In this paper, we develop a new technique for more efficient pattern mining. Our method find frequent 1-itemset and then uses the heap tree sorting we are generating frequent patterns, so that many. We present efficient techniques to implement the new approach.

Last modified: 2014-04-27 21:43:10