Improvement of Association Algorithm Based on Matrix Optimization
DOI:
https://doi.org/10.54097/fcis.v2i3.5411Keywords:
Frequent itemsets, Boolean matrix, Simplified matrix, Optimal connectionAbstract
In order to solve the problems of high memory usage and low efficiency of frequent itemsets generation in the process of data mining, the existing association algorithm is improved. The data information is expressed in the form of a Boolean matrix, and the matrix is continuously simplified in the operation to optimize the item set connection method, thereby reducing memory consumption and improving algorithm efficiency.
Downloads
References
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. Proc, 1993 ACM-SIGMOD Int, Conf. Management of Data (SIGMOD' 9 3), pp. 207-216, Washington, DC, May 1993.
M. Zaki. Scalable algorithms for association mining. IEEE Trans. Knowledge and Data Engineering, 12:372-390, 2000.
Ian H. Witten, Eibe Frank and Mark A. Hall. Data Mining: Practical Machine Learning Tools and Techniques [M]. China Machine Press. 2014.
Jiawei Han, Micheline Kamber, Jian Pei, Data Mining Concepts and Techniques Third Edition [M]. China Machine Press. 2019.
Cui Yan, Bao Zhiqiang. A survey of association rule mining[J]. Application Research of Computers, 2016,33(02):330-334.
Cai Weijie, Zhang Xiaohui, Zhu Jianqiu, Zhu Yangyong. A Survey of Association Rules Mining [J]. computer engineering ,2001(05): 31- 33+ 49.
