首页 | 本学科首页   官方微博 | 高级检索  
     

关联规则挖掘中若干关键技术的研究
引用本文:陈耿,朱玉全,杨鹤标,陆介平,宋余庆,孙志挥.关联规则挖掘中若干关键技术的研究[J].计算机研究与发展,2005,42(10):1785-1789.
作者姓名:陈耿  朱玉全  杨鹤标  陆介平  宋余庆  孙志挥
作者单位:1. 东南大学计算机科学与工程系,南京,210096
2. 江苏大学计算机科学与通信工程学院,镇江,212013
基金项目:江苏大学科研启动基金项目(04KJD001);国家自然科学基金项目(70371015)
摘    要:Apriori类算法已经成为关联规则挖掘中的经典算法,其技术难点及运算量主要集中在以下两个方面:①如何确定候选频繁项目集和计算项目集的支持数;②如何减少候选频繁项目集的个数以及扫描数据库的次数.目前已提出了许多改进方法来解决第2个问题,并已取得了很好的效果.然而,对于第1个问题,仍沿用Apriori算法中的解决方案,其运算量是较大的.为此,提出了一种基于二进制形式的候选频繁项目集生成和相应的计算支持数算法,该算法只需对挖掘对象进行一些“或”、“与”、“异或”等逻辑运算操作,显著降低了算法的实现难度,将该算法与Apriori类算法相结合,可以进一步提高算法的执行效率,实验结果也表明算法是有效、快速的.

关 键 词:数据挖掘  关联规则  频繁项目集
收稿时间:2004-05-26
修稿时间:2004-05-262004-12-20

Study of Some Key Techniques in Mining Association Rule
Chen Geng,Zhu Yuquan,Yang Hebiao,Lu Jieping,Song Yuqing,Sun Zhihui.Study of Some Key Techniques in Mining Association Rule[J].Journal of Computer Research and Development,2005,42(10):1785-1789.
Authors:Chen Geng  Zhu Yuquan  Yang Hebiao  Lu Jieping  Song Yuqing  Sun Zhihui
Abstract:The apriori algorithm has become a classic method for mining association rules. The difficulties and operation quantity of the apriori algorithm consist of the following two aspects: (1) how to generate candidate frequent itemsets and to calculate its support, (2) how to reduce the size of candidate frequent itemsets and times of accessing I?O. At present, there are many methods that can solve the second problems very well. However, very few methods have been presented to solve the first problem. An efficient and fast algorithm based on binary format for discovering candidate frequent itemsets and calculating the support of ite msets is proposed, which only executes some logical operation. A performanceco is given,and the e xperiments show that the new algorithm is more efficient.
Keywords:data mining  association rules  frequent itemsets
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号