Research Article
Performance Evaluation of Apriori and FP-Growth Algorithms
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 79 - Issue 10 |
| Published: October 2013 |
| Authors: M. S. Mythili, A. R. Mohamed Shanavas |
10.5120/13779-1650
|
M. S. Mythili, A. R. Mohamed Shanavas . Performance Evaluation of Apriori and FP-Growth Algorithms. International Journal of Computer Applications. 79, 10 (October 2013), 34-37. DOI=10.5120/13779-1650
@article{ 10.5120/13779-1650,
author = { M. S. Mythili,A. R. Mohamed Shanavas },
title = { Performance Evaluation of Apriori and FP-Growth Algorithms },
journal = { International Journal of Computer Applications },
year = { 2013 },
volume = { 79 },
number = { 10 },
pages = { 34-37 },
doi = { 10.5120/13779-1650 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2013
%A M. S. Mythili
%A A. R. Mohamed Shanavas
%T Performance Evaluation of Apriori and FP-Growth Algorithms%T
%J International Journal of Computer Applications
%V 79
%N 10
%P 34-37
%R 10.5120/13779-1650
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In Data Mining, Association Rule Mining is a standard and well researched technique for locating fascinating relations between variables in large databases. Association rule is used as a precursor to different Data Mining techniques like classification, clustering and prediction. The aim of the paper is to guage the performance of the Apriori algorithm and Frequent Pattern (FP) growth algorithm by comparing their capabilities. The evaluation study shows that the FP-growth algorithm is efficient and ascendable than the Apriori algorithm.
References
- N. P. Gopalan and B. Sivaselvan, "Data Mining Techniques and Trends", PHI Learning private limited, New Delhi,2009.
- Han, J. , Kamber, M. ,"Data Mining concepts and techniques", Elsevier Inc. , Second Edition, San Francisco, 2006.
- R. Agrawal, R. Srikant. "Fast algorithms for mining association rules in large databases". Proc. of 20th Int'l conf. on VLDB: 487-499, 1994.
- Ashok Savasere,Edward Omieinski and Shankant Navathe, "An Efficient Algorithm for Mining Association Rules in Large Databases", Proceedings of the 21st International Conference on Very Large Data Bases, pp. 432 – 444,2005.
- R. Agrawal, T. Imielinski, and A. Swami, "Mining Association Rules Between Sets Of Items In Large Databases", In proceedings of the ACM SIGMOD International Conference on Management of data, pp. 207-216,1993.
- M. J. Zaki and C. J. Hsiao, "CHARM: An efficient algorithm for closed association rule mining", Technical Report 99-10, Computer Science Dept. , Rensselaer Polytechnic Institute,1999.
- Sotiris Kotsiantis and Dimitris Kanellopoulos,"Association Rules Mining: A Recent Overview", GESTS International Transactions on Computer Science and Engineering, Vol. 32, No: 1, pp. 71-82, 2006.
- Anurag Choubey, Ravindra Patel,J. L. Rana, "A Survey Of Efficient Algorithms And New Approach For Fast Discovery Of Frequent Item Set For Association Rule Mining", International Journal of Soft Computing and Engineering,2011.
- Rakesh Agrawal and Ramakrishnan Srikant, "Fast Algorithms For Mining Association Rules In Large Databases", In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, pp 487- 499, Santiago, Chile,1994.
- M. Houtsma, and Arun Swami, "Set-Oriented Mining for Association Rules in Relational Databases", IEEE International Conference on Data Engineering, pp. 25–33, 1995.
Index Terms
Keywords