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

基于Apriori算法的多维关联规则挖掘研究
引用本文:绳英英,闫仁武,王加民,李佳. 基于Apriori算法的多维关联规则挖掘研究[J]. 科学技术与工程, 2009, 9(7)
作者姓名:绳英英  闫仁武  王加民  李佳
作者单位:江苏科技大学计算机科学与工程学院,镇江,212003;江苏科技大学计算机科学与工程学院,镇江,212003;江苏科技大学计算机科学与工程学院,镇江,212003;江苏科技大学计算机科学与工程学院,镇江,212003
摘    要:关联规则是数据挖掘中的一个重要研究方向.经典的Apriori算法是一种最有影响的挖掘布尔型关联规则频繁项集的算法,但其并不适合挖掘近年来兴起的多维数据模型.在改进Apriori算法的基础上,提出了一种二次剪枝的算法,此算法适用于挖掘多维关联规则,并且在一定程度上提高了算法效率.

关 键 词:数据挖掘  多维关联规则  数据立方体  Apriori算法

Research Multi-dimensional Association Rule Mining Based on Apriori Algorithm
SHENG Ying-ying,YAN Ren-wu,WANG Jia-min,LI Jia. Research Multi-dimensional Association Rule Mining Based on Apriori Algorithm[J]. Science Technology and Engineering, 2009, 9(7)
Authors:SHENG Ying-ying  YAN Ren-wu  WANG Jia-min  LI Jia
Affiliation:School of Computer Science & Engineering;Jiangsu University of Science and Technology;Zhenjiang 212003;P.R.China
Abstract:Association rules mining is very important in the application of data mining.Classic Apriori algorithm is one of the most influential association rules in mining boolean frequent itemsets algorithms,but is not suitable for mining multi-dimensional data model which rise in recent years.A second cut method is proposed,which is on the basis of the Apriori algorithm.The algorithm applies to multi-dimensional mining association rules,and to some extent improved the efficiency of the algorithm.
Keywords:data mining multidimensional association rules data cube Apriori arithmetic  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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