期刊文献+

引入影响度的关联规则衡量标准 被引量:7

Evaluation criterion for association rules with influence degree
在线阅读 下载PDF
导出
摘要 关联规则挖掘是数据挖掘中重要的研究课题,而其中一个重要问题是对挖掘出的规则的感兴趣程度的评估。分析并讨论了传统支持度-置信度框架、相关度和有效度等衡量标准的不足,并将T检验思想引入到关联规则的衡量中,提出了一种新的关联规则衡量标准-影响度。实验结果表明,在传统挖掘方法的基础上引入影响度,可以有效克服现有衡量标准的一些不足,减少冗余规则的产生。 Discovering association rules is one of more important tasks in data mining.One of the important problems is the evaluation of interestingness for the discovered rules.Authors analyze and discuss the shortage of the support-confidence framework,the correlativity and the validity.With introducing T-Testing,authors propose the Effect that is a new evaluation criterion for associa- tion rules.The experimental result shows that introducing effect based on common approach to association rules mining can effec- tively overcome the shortage of the existing evaluation criterion for association rules, and reduce the creation of redundant rules.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第8期141-142,177,共3页 Computer Engineering and Applications
关键词 关联规则 T检验 影响度 衡量标准 association rule T-Testing influence degree evaluation criterion
  • 相关文献

参考文献5

二级参考文献9

  • 1刘君强.[D].杭州: 浙江大学计算机科学与技术学院,2003.
  • 2[1]Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases[A]. Proc of ACM SIGMOD Conf on Management of Data[C]. Washington,1993.207-216.
  • 3[2]Agrawal R, Srikant R. Fast algorithms for mining association rules[A]. Proc of the 20th Int Conf on Very Large Databases[C]. Santiago,1994.487-499.
  • 4[3]Agrawal R, Mannila H, Srikant R, et al. Fast discovery of association rules[A]. Advances in Knowledge Discovery and Data Mining[C]. AAAI/MIT Press,1996.307-328.
  • 5[4]Brin S, Motwani R, Silverstein C. Beyond market basket: Generalizing association rules to correlations[A]. Proc 1997 ACM-SIGMOD Int Conf Management ofData[C]. Tucson,1997.265-276.
  • 6[5]Srikant R, Agrawal R. Mining generalized association rules[A]. Proc of the 21st Int Conf on Very Large Data Bases[C]. Zurich,1995.407-419.
  • 7[6]Srikant R, Agrawal R. Mining quantitative association rules[A]. Proc of the ACM SIGMOD[C]. Montreal,1996.1-12.
  • 8[7]Savasere A, Omiecinski E, Navathe S. Mining forstrong negative association in a large database of customer transactions[A]. Proc of the Int Conf on Data Engineering[C]. Orlando,1998.494-502 .
  • 9周欣,沙朝锋,朱扬勇,施伯乐.兴趣度——关联规则的又一个阈值[J].计算机研究与发展,2000,37(5):627-633. 被引量:91

共引文献41

同被引文献35

引证文献7

二级引证文献54

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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