Abstract

In this study, generating association rules with improved Apriori algorithm is proposed. Apriori is one of the most popular association rule mining algorithm that extracts frequent item sets from large databases. The traditional Apriori algorithm contains a major drawback. This algorithm wastes time in scanning the database to generate frequent item sets. The objective of any association rule mining algorithm is to generate association rules in a fast manner with great accuracy. In this study, a modification over the traditional Apriori algorithm is introduced. This improved Apriori algorithm searches frequent item sets from the large databases with less time. Experimental results shows that this improved Apriori algorithm reduces the scanning time as much as 67% and this algorithm is more efficient than the existing algorithm.

Keywords:

Apriori, ARM, , association rule mining, , ELCAT, , frequent pattern, , large datasets, , support chaining,

References

1. Agrawal, R., T. Imielinski and A. Swami, 1993. Mining association rules between sets of items in large databasesm. Proceeding of the ACM SIGMOD International Conference on Management of Data. ACM Press, New York, pp: 207-216.
   CrossRef    
2. Buehrer, G., S. Parthasarathy, S. Tatikonda, T. Kurc and J. Saltz, 2007. Toward terabyte pattern mining: An architecture-conscious solution. Proceeding of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp: 2-12.
   CrossRef    
3. El-Hajj, M. and O.R. Zaiane, 2006. Parallel leap: Large-scale maximal pattern mining in a distributed environment. Proceeding of the 12th International Conference on Parallel and Distributed Systems, pp: 128-136.
   CrossRef    
4. Fakhrahmad, S.M., M.H. Sadreddini and M.Z. Jahromi, 2007. Mining frequent item sets in large data warehouses. Proceeding of the 8th International Conference on Intelligent Data Engineering and Automated Learning, pp: 517-526.
   
5. Fang, W., M. Lu, X. Xiao, B. He and Q. Luo, 2009. Frequent itemset mining on graphics processors. Proceeding of the 5th International Workshop on Data Management on New Hardware, pp: 97-105.
   CrossRef    
6. Kessl, R. and P. Tvrdk, 2007. Toward more parallel frequent itemset mining algorithms. Proceeding of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems, pp: 317-328.
   
7. Li, H., Y. Wang, D. Zhang, M. Zhang and E.Y. Chang, 2008. Pfp: Parallel fp-growth for query recommendation. Proceeding of the ACM Conference on Recommender Systems, pp: 107-114.
   CrossRef    
8. Liu, L., E. Li, Y. Zhang and Z. Tang, 2007. Optimization of frequent itemset mining on multiple-core processor. Proceeding of the 33rd International Conference on Very Large Data Bases (VLDB, 2007), pp: 1275-1285.
   
9. Sandhu, P.S., D.S. Dhaliwal, S.N. Panda and A. Bisht, 2010. An improvement in apriori algorithm using profit and quantity. Proceeding of the 2nd International Conference on Computer and Network Technology (ICCNT, 2010), pp: 3-7, April 23-25.
   CrossRef    
10. Yanbin, Y. and C. Chia-Chu, 2006. A parallel apriori algorithm for frequent itemsets mining. Proceeding of the 4th International Conference on Software Engineering Research, Management and Applications, pp: 87-94, August 9-11.
    CrossRef    
11. Ye, Y. and C.C. Chiang, 2006. A parallel apriori algorithm for frequent itemsets mining. Proceeding of the 4th International Conference on Publication Software Engineering Research, Management and Applications, pp: 87-94.
    PMCid:PMC2230637    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.