An Innovative Technique for Enhancing the Performance of Association Rules Mining for Apriori Algorithm

International Journal of Computer Science (IJCS) Published by SK Research Group of Companies (SKRGC)

Abstract

The art of data mining has been constantly evolving. There are a number of innovative and intuitive techniques that have emerged that fine-tune data mining concepts in a bid to give companies more comprehensive insight into their own data with useful future trends. Businesses can use data mining for knowledge discovery and exploration of available data. This can help them predict future trends, understand customer’s preferences and purchase habits, and conduct a constructive market analysis. They can then build models based on historical data patterns and garner more from targeted market campaigns as well as strategize more profitable selling approaches. Data mining helps enterprises to make informed business decisions, enhances business intelligence, thereby improving the company’s revenue and reducing cost overheads. We consider the problem of discovering association rules between items in a large database of sales transactions. We proposed a new algorithm for solving this problem that is fundamentally based on and improved upon Apriori Algorithm and its other updated versions. The proposed method is to find out all the frequent Item sets without scanning DB so many times. Count the support of the frequent itemsets by scanning the DB another time; Output the association rules from the frequent itemsets. The proposed algorithm in this paper reduces the times of scanning DB.

References

1) R. Agrawal, T. Imielinski, and A. Swami, “Mining Association Rules Between Sets of Items in Large Databases”, Proceedings of the ACM SIGMOD Conference on Management of data, pp.207-216, May 1993.

2) R. Agrawal, and R. Srikant, "Fast Algorithms for Mining Association Rules", In Proc. VLDB 1994, pp.487-499.

3) Sujni Paul, and V. Saravanan, “Hash Partitioned Apriori in Parallel and Distributed Data Mining Environment with Dynamic Data Allocation Approach”, Computer Science and Information Technology, 2008. ICCSIT'08.International Conference on Aug. 29 2008-Sept. 2 2008, pp.481-485

4) Lei Ji, Baowen Zhang, and Jianhua Li, “A New Improvement on Apriori Algorithm”, Computational Intelligence and Security, 2006 International Conference on Volume 1, Nov. 2006, pp.840-844

5) Kun-Ming Yu, Jia-Ling Zhou, “A Weighted Load-Balancing Parallel Apriori Algorithm for Association Rule Mining”, Granular Computing, 2008. GrC 2008. IEEE International Conference on 26- 28 Aug. 2008, pp.756-761

6) R. Agrawal, T. Imielinski, and A. Swami, “Mining association rules between sets of items in large databases”, SIGMOD, pg 207 - 216, 1999.

7) Bing Liu, Wynne Hsu and Yiming Ma, “Mining association rules with multiple minimum supports. In ACM Special Interest Group on Knowledge Discovery and Data Mining Explorations, pp.337–341 (1999).

8) Michael Hashler, “A Model-Based frequency constraint for mining associations from transaction data” at Springer Science & Business Media, LLC. Manufactured in the United States, Data Mining and Knowledge Discovery, 13, 137–166, 2006.

9) Ramya, V & Baskaran S. (2917), Design and Implementation of an Online Social Network Application with Privacy Violation Detector Based on text Mining Technique, International Journal of Computer Science, Vol 5, Issue 2 , pp. 2020-2026.

Keywords

Association Rules, Apriori Algorithm, Association Analysis, Frequent Pattern.