Mining Efficient Association Rules Through Apriori Algorithm Using Attributes

In data mining a number of algorithms has been proposed. Each algorithm has a different objective. A lot of research has been done on these various data mining fields and algorithms. Extraction of valuable data from large dataset is an emerging problem. Apriori algorithm is the algorithm to extract association rules from dataset. Apriori algorithm is not an efficient algorithm as it is a time consuming algorithm in case of large dataset. With the time a number of changes proposed in Apriori to enhance the performance in term of time and number of database passes. This paper illustrate the apriori algorithm disadvantages and utilization of attributes which can improve the efficiency of apriori algorithm.

[1]  Markus Hegland,et al.  Algorithms for Association Rules , 2002, Machine Learning Summer School.

[2]  Laks V. S. Lakshmanan,et al.  The segment support map: scalable mining of frequent itemsets , 2000, SKDD.

[3]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[4]  Graham J. Williams,et al.  Data Mining , 2000, Communications in Computer and Information Science.

[5]  Jian Pei,et al.  Mining frequent patterns by pattern-growth: methodology and implications , 2000, SKDD.

[6]  Siu Cheung Hui,et al.  Mining Frequent Itemsets with Category-Based Constraints , 2003, Discovery Science.

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

[8]  Karl Rihaczek,et al.  1. WHAT IS DATA MINING? , 2019, Data Mining for the Social Sciences.

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

[10]  Peiyi Tang,et al.  Parallelizing Frequent Itemset Mining with FP-Trees , 2006, Computers and Their Applications.

[11]  B. Shekar,et al.  A relatedness-based data-driven approach to determination of interestingness of association rules , 2005, SAC '05.

[12]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

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

[14]  Howard J. Hamilton,et al.  Knowledge discovery and measures of interest , 2001 .

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