计算机应用 ›› 2005, Vol. 25 ›› Issue (08): 1827-1829.DOI: 10.3724/SP.J.1087.2005.01827

• 数据库与人工智能 • 上一篇    下一篇

基于参考度的关联规则挖掘

林嘉宜1,2,彭宏1,郑启伦1,李颖基1   

  1. 1.华南理工大学计算机科学与工程学院; 2.中华人民共和国黄埔海关
  • 发布日期:2011-04-07 出版日期:2005-08-01
  • 基金资助:

    广东省科技攻关项目(A10202001);;广州市科技攻关项目(2004Z2-D0091);;广东省自然科学基金资助项目(031454)

Mining association rules based on consult measure

LIN Jia-yi1,2,PENG Hong1, ZHENG Qi-lun1,LI Ying-ji1   

  1. 1.School of Computer Science and Engineering,South China University of Technology,Guangzhou Guangdong 510641,China; 2.Huang Pu Customs District of Peoples Republic of China,Guangzhou Guangdong 510730,China
  • Online:2011-04-07 Published:2005-08-01

摘要: 针对现有关联规则挖掘的评价标准存在的问题,提出在评价标准中增加参考度,并给出了参考度的定义和基于参考度的关联规则挖掘算法。利用参考度将关联规则分为正关联规则、负关联规则和无效关联规则,从而可以用算法挖掘带有负项的关联规则。最后给出了新算法的实验分析。

关键词: 数据挖掘, 关联规则, 参考度

Abstract: Some problems of the current measures for association rules were analyzed. A new measure named consult was defined and added to the mining algorithm for association rules. According to the value of consult, association rules were classified into positive, negative and invalid association rules. The new algorithm could find out the negative-item-contained rules. Finally, the algorithm was evaluated and analyzed through experiments and practices.

Key words: data mining, association rules, consult measure

中图分类号: