The Apriori algorithm is a classical method of association rules mining. Based on analysis of this theory, the paper provides an improved Apriori algorithm. The paper puts foward with algorithm combines HASH table technique and reduction of candidate item sets to enhance the usage efficiency of resources as well as the individualized service of the data library.
陆觉民,郑宇 . 数据挖掘技术的改进在图书馆个性化服务中的应用[J]. 现代图书情报技术, 2006, 1(8): 65-68.
Lu Juemin,Zheng Yu . Application of the Improving Data Mining Technique in the Individualized Service of the Digital Library. New Technology of Library and Information Service, 2006, 1(8): 65-68.
1Agrawal R , Imielinski T ,Swami A.. Mining Associations Rules Between Sets of Items in Large Databases. Proceedings of ACM SIGMOD Intl. Conf. on Management of Data Acm Press, 1993.207-216
2J.S.Park, M.S.Chen, and P.S.Yu. An effective hash-based algorithm for mining association rules. ACM SIGMOD Record ACM Press, 1995. 175-186
3李绪成,王保保. 挖掘关联规则中Apriori算法的一种改进.计算机工程,2002,7(28):104-105
4魏育辉,潘洁. 图书流通数据关联挖掘量化分析法. 现代情报,2005(11):108-110
5冯进.利用数据挖掘技术深入挖掘图书馆工作.现代情报,2005(3):131-132