The Optimization Algorithm of Association Rules Mining

Abstract:

Frequent itemsets mining is the core part of association rule mining. At present most of the research on association rules mining is focused on how to improve the efficiency of mining frequent itemsets , however, the rule sets generated from frequent itemsets are the final results presented to decision makers for making, so how to optimize the rulesets generation process and the final rules is also worthy of attention. Based on encoding the dataset, this paper proposes a encoding method to speed up the generation process of frequent itemsets and proposes a subset tree to generate association rules which can simplify the generation process of rules and narrow the rulesets presented to decision makers.

• Periodical: Applied Mechanics and Materials (Volume 614)
• Pages: 405-408
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.614.405
• Online since: September 2014
• Authors: Zhen Yu Liu*, Zhi Hui Song, Rui Qing Yan, Zeng Zhang
• Keywords: Aprior, Association Rule, Frequent Itemsets, Subset-Tree

References

[1] R. Agrawal, T. Imielinski, A. Swami. Mining Association Rules between Sets of Items in Large Database. ACM SIGMOD Conference Proceedings on Management of Data, pages 207-216, (1993).

DOI: 10.1145/170036.170072

[2] R. Agrawal, R. Srikant. Fast Algorithms for Mining Association Rules. International conference on very large database (VLDB), pages 487-499, (1994).

[3] Roberto J. Bayardo Jr, Rakesh Agrawal, Dimitrios Gunopulos. Constraint-Based Rule Mining in Large, Dense Databases. Journal of Data Mining and Knowledge Discovery, Volume 4, Numbers 2-3, pages 217-240, (2000).

DOI: 10.1023/a:1009895914772

[4] Jiawei Han, Micheline Kamber. Data Mining Concepts and Techniques, Second Edition, Translated by Fanming, Menxiao Feng, China Machine Press, (2007).