EFFICIENT ALGORITHM FOR MINING FREQUENT ITEMSETS USING CLUSTERING TECHNIQUES

Now a days, Association rule plays an important role. The purchasing of one product when another product is purchased represents an association rule. The Apriori algorithm is the basic algorithm for mining association rules. This paper presents an efficient Partition Algorithm for Mining Frequent Itemsets(PAFI) using clustering. This algorithm finds the frequent itemsets by partitioning the database transactions into clusters. Clusters are formed based on the similarity measures between the transactions. Then it finds the frequent itemsets with the transactions in the clusters directly using improved Apriori algorithm which further reduces the number of scans in the database and hence improve the efficiency.

[1]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[2]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[3]  Arun N. Swami,et al.  Set-oriented mining for association rules in relational databases , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[4]  Wen-Yang Lin,et al.  CBW: an efficient algorithm for frequent itemset mining , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[5]  Margaret H. Dunham,et al.  Data Mining: Introductory and Advanced Topics , 2002 .

[6]  Ye-In Chang,et al.  A Graph-Based Approach for Mining Closed Large Itemsets , 2010 .

[7]  Yang Cheng,et al.  The Research of Improved Apriori Algorithm for Mining Association Rules , 2007, 2007 International Conference on Service Systems and Service Management.

[8]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[9]  Akhilesh Tiwari,et al.  Cluster Based Partition Approach for Mining Frequent Itemsets , 2009 .