期刊文献+

Apriori算法低频规则的有效性及实现 被引量:4

Effectiveness and implementation of low frequency rule based on Apriori algorithm
下载PDF
导出
摘要 针对经典Apriori算法基于全局、高频两个条件的缺陷,指出事务数据库低频规则的有效性,并通过对C4.5决策树的规则构造,进一步证明事务数据库存在低频规则,在此基础上,给出了一种Apriori低频规则挖掘算法。该算法与经典的Apriori算法兼容,但不是对Apriori算法简单的扩展,而是从理论上打破了Apriori算法基于全局和高频两个条件。最后通过实例用Apriori低频规则挖掘算法和C4.5算法对实例数据库进行挖掘,证明两者的一致性和Apriori低频规则的有效性,同时也证明了Apriori低频规则挖掘算法的有效性。 Firstly,the defects of classical Apriori algorithm based on global view and high frequency were pointed out,and the effectiveness of low frequency rule of transaction database was presented.By constructing the rules of C4.5 decision tree,that the low frequency rule exists in transaction database also was proved.On the foundation of this,a mining algorithm based on low frequency rule of Apriori algorithm was given,which was compatible with classical Apriori algorithm.However,it was not a simple extension of Apriori algorithm,it had broken theoretically Apriori algorithm view based on global view and high frequency.Finally,case database was mined by mining algorithm based on low frequency rule of Apriori and C4.5 algorithms,and the consistency of two methods and the effectiveness of low frequency rule were proved.Moreover,the effectiveness of mining algorithm based on low frequency rule of Apriori algorithm was validated.
出处 《计算机应用》 CSCD 北大核心 2011年第2期435-437,共3页 journal of Computer Applications
基金 内蒙古人才基金资助项目(第8批) 内蒙古教育科研项目(NJZY07140)
关键词 APRIORI算法 低频规则 有效性 C4.5算法 数据挖掘 Apriori algorithm low frequency rule effectiveness C4.5 algorithm data mining
  • 相关文献

参考文献12

二级参考文献44

共引文献109

同被引文献33

  • 1颜跃进,李舟军,陈火旺.基于FP-Tree有效挖掘最大频繁项集[J].软件学报,2005,16(2):215-222. 被引量:68
  • 2徐前方,肖波,郭军.一种基于相关度统计的告警关联规则挖掘算法[J].北京邮电大学学报,2007,30(1):66-70. 被引量:15
  • 3吉根林,韦素云.分布式环境下约束性关联规则的快速挖掘[J].小型微型计算机系统,2007,28(5):882-885. 被引量:7
  • 4AGRAWAL R,IMIELINSKE T,SWAMI A ,Mining association rules berween sets of items in larger databases[C]//Proc1993 ACM-SIGMOD Int Conf Mangement of Data (SIGMOND 93).Washington DC:[s.n.]1993:207-216.
  • 5AGRAWAL R,SRIKANT R,Fast algolithems for mining association rules large databasee[R].San Jose ,CA:IBM Almaden Resarch Center,1994.
  • 6TAN Pang-ning,STEINBACH M,KUMAR V,et al,Introduction to data mining[M].Beijing:Pasts&Telecon Press,2006:209-221.
  • 7Han J,Kamber M.数据挖掘概念与技术[M].范明,孟小峰,译.北京:机械工业出版社,2002:223-262.
  • 8Pang,N.T.&S.Michael.数据挖掘导论[M].范明等,译.北京:人民邮电出版社,2007.
  • 9Omiecinsky E, Sarasere A, Navathe S. An efficient Algorithm for Mining Association Rules in Large Databases: Proceedings of the 21th International Conference on Very Large Data Bases,1995 [C]. San Francisco: Morgan Kaufmann Pubhshers Ine,1995:432-444.
  • 10陈文伟.基于本体的可拓知识链获取[J].智能系统学报,2007,2(6):68-71. 被引量:12

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部