The week's pick
Random Articles
Reseach Article
A Performance based Transaction Reduction Algorithm for Discovering Frequent Patterns
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 98 - Number 4 |
| Year of Publication: 2014 |
| Authors: V. Vijayalakshmi, A. Pethalakshmi |
10.5120/17170-7242
|
V. Vijayalakshmi, A. Pethalakshmi . A Performance based Transaction Reduction Algorithm for Discovering Frequent Patterns. International Journal of Computer Applications. 98, 4 ( July 2014), 18-21. DOI=10.5120/17170-7242
Abstract
Association rules are the main technique to determine the frequent item set in data mining. When a large number of item sets are processed by the database, it needs to be scanned multiple times. Consecutively, multiple scanning of the database increases the number of rules generation, which then consume more system resources. Existing approach TR-BAM scans the unnecessary transaction which takes more time to find frequent item set. This paper presents a modified transaction reduction technique named PBTRA which reduces the scanning times by cutting down the unnecessary transaction row. So, the corresponding item set is extracted directly without moving for entire database. Moreover, it exploits horizontal transaction of the matrix that automatically reduces the entire database scanning. Experimental results validate the performance of the proposed approach and expose that proposed method is more effective and efficient than previously proposed algorithm.
References
- Agrawal, R. , Imielinski, T. , and Swami, A. N. Mining Association Rules Between Sets of Items in Large Databases. Proceedings of the ACM SIGMOD, International Conference on Management of Data, pp. 207- 216,
- Agrawal. R. , and Srikant. R. , Fast Algorithms for Mining Association Rules, Proceedings of 20th International Conference of Very Large Data Bases. pp. 487-499,1994.
- M. S. Chen, J. Han, and P. S. Yu. Data mining: An overview from a database Perspective. IEEE Trans. Knowledge and Data Engineering, 8:866-883, 1996.
- U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy. Advances in Knowledge Discovery and Data Mining. AAAI/MIT Press, 1996.
- Agarwal, R. Agarwal, C. and Prasad V. , A tree projection algorithm for generation of frequent item sets. In J. Parallel and Distributed Computing, 2000
- L. Cheng and B. B. Wang, "An Improved Apriori Algorithm for Mining Association Rules, " Comput. Eng. , Shanghai, vol. 28(7), pp. 104-105, 2002.
- Sheng Chai; Jia Yang; Yang Cheng;," The Research of Improved Apriori Algorithm for Mining Association Rules," Service System and Service Management, 2007 International Conference on, vol. , no. ,pp. 1-4, 9-11 June 2007
- Li Xiaohong,Shang Jin. An improvement of the new Apriori algorithm [J]. Computer science, 2007,34 (4) :196-198. 2007
- Wanjun Yu, Xiachun Wang and et. al, (2008), "The Research of Improved Apriori Algorithm for Mining Association Rules", pp. 513-516
- PEI Guying. A Fast Algorithm for Mining of Association Rules Based on Boolean Matrix. Automation & Instrumentation. 2009; 5: 16-18.
- LV Taoxia, LIU Peiyu. Algorithm for Generating Strong Association Rules Based on Matrix. Application Research of Computers. 2011; 28(4): 1301- 1303
- ZHANG Zhongping, LI Yan, YANG Jing. Frequent Itemsets Mining Algorithm Based on Matrix. Computer Engineering. 2009; 35(1): 84-85.
- S. Prakash, R. M. S. Parvathi. , An Enhanced Scaling Apriori for Association Rule Mining Efficiency. European Journal of Scientific Research, ISSN 1450-216X Vol. 39 No. 2 (2010), pp. 257-264
- Wang Lifeng. An Efficient Association Rule Algorithm Based on Boolean Matrix. International Review on Computers and Software. 2012; 7(2): 695-700.
- Database URL: http://www2. cs. Uregina . ca/~ dbd/ cs831/ notes/ itemsets/ datasets. php.
- V. Vijayalakshmi, A. Pethalakshmi. , "Mining of Frequent Itemsets With an Enhanced Apriori Algorithm", IJCA, Vol 81-No. 4, November 2013
Index Terms
Keywords