Mining Frequent ItemSet Based on Clustering of Bit Vectors

Objectives: In data mining, finding frequent item set from voluminous databases is an important role. It is a challenging task to find item sets frequently arise in the exponential growth of the databases. The number of scans to find the frequent item set is assessed as more and created redundancy. Methods/Statistical analysis: In this research work, a new technique is applied to improve the reduction in number of scans and minimize the redundancy. An algorithm is developed to mine the frequent item set using clustering techniques. A cluster table of frequent item set is created with minimal number of scanning. Findings: The support count is fixed to eliminate the duplicates which minimize the redundancy. This algorithm is appreciable, because the intermediate data in the dataset can be reused. The efficiency of algorithm can be identified by seeing the experimental results that is significantly performed well than the exiting algorithms. Applications/Improvements: In future, other algorithms are applied for the same data set to test its effectiveness in order to minimize the redundancy which avoids wastage of the memory space.

[1]  Jie Dong,et al.  BitTableFI: An efficient mining frequent itemsets algorithm , 2007, Knowl. Based Syst..

[2]  Yuh-Jiuan Tsay,et al.  CBAR: an efficient method for mining association rules , 2005, Knowl. Based Syst..

[3]  A. Chilambuchelvan,et al.  Enhanced Candidate Generation for Frequent Item Set Generation , 2015 .

[4]  Yungho Leu,et al.  An effective Boolean algorithm for mining association rules in large databases , 1999, Proceedings. 6th International Conference on Advanced Systems for Advanced Applications.

[5]  Chaohui Liu,et al.  Fast Mining and Updating Frequent Itemsets , 2008, 2008 ISECS International Colloquium on Computing, Communication, Control, and Management.

[6]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[7]  PeiJian,et al.  Mining Frequent Patterns without Candidate Generation , 2000 .

[8]  Ramachandran Baskaran,et al.  Cluster based bit vector mining algorithm for finding frequent itemsets in temporal databases , 2011, WCIT.

[9]  Khairuddin Omar,et al.  Scalable and efficient method for mining association rules , 2009, 2009 International Conference on Electrical Engineering and Informatics.

[10]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[11]  Li Jun,et al.  An Improved Apriori Algorithm Based On the Boolean Matrix and Hadoop , 2011 .

[12]  Yu Zhao-ping,et al.  Improved Method of Apriori Algorithm Based on Matrix , 2006 .