The week's pick
Reseach Article
Runtime and Space Complexity Comparison of the various Association Algorithms
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 95 - Number 16 |
| Year of Publication: 2014 |
| Authors: K. Fathima Bibi, M. Nazreen Banu |
10.5120/16676-6780
|
K. Fathima Bibi, M. Nazreen Banu . Runtime and Space Complexity Comparison of the various Association Algorithms. International Journal of Computer Applications. 95, 16 ( June 2014), 6-10. DOI=10.5120/16676-6780
Abstract
Data mining has become an indispensable technology for businesses and researchers in many fields. Discovering frequent itemsets is a key problem in important data mining applications. Typical association algorithms for solving this problem operate in a bottom-up, top-down and breadth-first search direction. The computation starts from frequent 1-itemsets (the minimum length frequent itemsets) and continues until all maximal (length) frequent itemsets are found. Algorithms perform well when all maximal frequent itemsets are short. However, performance drastically decreases when some of the maximal frequent itemsets are relatively long. This paper focuses on finding Maximum Frequent Set with the implementation of the APRIORI and the Dynamic Itemset Counting Algorithm (DIC) and a comparative study with Pincer Search Algorithm to select the fast algorithm for discovering the Maximum Frequent Set.
References
- www. dama-ncr. org
- R. Agrawal, T. Imilienski, and A. Swami. Database Mining: A Performance Perspective. IEEE Transactions on Knowledge and Data Engineering, 5(6):914--925, December 1993.
- R. Agrawal, T. Imilienski, and A. Swami. Mining Association Rules between Sets of Items in Large Databases. Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, pages 207--216, May 1993.
- R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994.
- R. Agrawal and R. Srikant. Mining sequential patterns. In Proceedings of the 11th International Conference on Data Engineering, Taipei, Taiwan, 1995.
- R. Agrawal, K. Lin, S. Sawhney, and K. Shim. Fast similarity search in the presence of noise, scaling and translation in time-series databases. In Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), 1995.
- R. Srikant and R. Agrawal. Mining generalized association rules. 1995.
- M. Mehta, R. Agrawal, and J. Rissanen. Sliq: A fast scalable classifier for data mining. March 1996.
- H. Toivonen. Sampling large databases for association rules. Proc. of the Int'l Conf. on Very Large Data Bases (VLDB), 1996.
- Sergey Brin, Rajeev Motwani y Jeffrey D. Ullman z, Dynamic Itemset Counting and Implication Rules for Market Basket Data, Department of Computer Science, Stanford University, Shalom Tsur, R&D Division, Hitachi America Ltd.
Index Terms
Keywords