IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 7    
Website: http://www.ijser.org
scirp IJSER >> Volume 3,Issue 7,July 2012
Association Rule Mining based on Apriori Algorithm in Minimizing Candidate Generation
Full Text(PDF, )  PP.171-174  
Sheila A. Abaya
Apriori algorithm, data mining, frequent items, set size
Association Rule Mining is an area of data mining that focuses on pruning candidate keys. An Apriori algorithm is the most commonly used Association Rule Mining. This algorithm somehow has limitation and thus, giving the opportunity to do this research. This paper introduces a new way in which the Apriori algorithm can be improved. The modified algorithm introduces factors such as set size and set size frequency which in turn are being used to eliminate non significant candidate keys. With the use of these factors, the modified algorithm introduces a more efficient and effective way of minimizing candidate keys.
[1] D. Kerana Hanirex, and M.A. Dorai Rangaswamy. 2011. Efficient Algorithm for Mining Frequent Itemsets using Clustering Techniques. International Journal on Computer Science and Engineering (IJCSE) Vol. 3 No. 3 March 2011.

[2] E. Ramaraj and N. Vankatesan, ― Bit Stream Mask Search Algorithm in Frequent Itemset Mining,‖ European Journal of Scientific Reasearch,‖ Vol. 27 No. 2 (2009), pp. 286-297

[3] J. Han, M. Kamber, ―Data Mining: Concepts and Techniques,‖ Morgan Kauffman, San Francisco, 2000

[4] J.5 Han, J. Pei and Y.Yin, ―Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach,‖ In Proceedings ACM-SIGMOD International Conference Management of Data (SIG MOD’04), pages 53-87, 2004

[5] J. Hossen, A. Rahman, K. Samsudin, F. Rokhani, S. Sayeed, and R. Hasan, ― A Novel Modified Adaptive Fuzzy Inference Engine and Its Application to Pattern Classification, World Academy of Science, Engineering and Technology 80, 2011

[6] M. H. Marghny and A.A. Mitwaly, ―Fast Algorithm for Mining Association Rules,‖ In proceedings of the First ICGST International Conference on Artificial Intelligence and Machine ELearning AIML05, pages 36-40, Dec. 2005

[7] Mamta Dhanda, ―An Approach to Extract Efficient Frequent Patterns from transactional database,‖ International Journal of Engineering Science and Technology (IJEST), Vol.3 No.7, July 2011, pp. 5652-5658

[8] P.Purdon, D. Gucht and D. Groth,‖ Average Case Performance of the Apriori Algorithm,‖ Society for Industrial and Applied Mathematics (2004) Vol. 33 No.5 pp. 1223-1260

[9] R. Agrawal and R. Srikant, ―Fast algorithms for mining association rules,‖ in Proceedings of the 20th VLDB Conference, 1994, pp. 487-499

[10] R. Agrawal, T. Imielinski and A. Swami, ―Mining association rules between sets of items in large databases.‖ SIGMOD’93, 207-216, Washington, D.C.

[11] S. Murali Krishna and S. Durgs Bhavani, ― An Efficient Approach for Text Clustering Basaed on Frequent Itemsets,‖ European Journal of Scientific Research, Vol. 42 No. 3 (2010), pp.385- 396

[12] S. Prakash and R.M.S. Parvathi, ―An Enhanced Scaling Apriori for Association Rule Mining Efficiency,‖ European Journal of Scientific Research, Vol. 39 No. 2 (2010), pages 257-264

Untitled Page