期刊文献+

基于兴趣度的关联规则挖掘研究 被引量:10

Research on Association Rule Mining Based on the Interestingness
原文传递
导出
摘要 关联规则挖掘是数据挖掘领域的一个重要研究方向,规则膨胀的问题是困扰规则发现和应用的主要问题。为了得到数量少、质量优的关联规则,给出了一种同时挖掘正、负有趣关联规则的算法。采用置信度增量替代置信度,引用一种兴趣度量标准,避免生成相互矛盾的、虚假的关联规则。在得到关联规则后,又对预期的和可推导的关联规则进行了修剪。 Association rules mining is an important research direction in data mining field.Rules explo sion is a key problem in rules discovery and rules application.In order to obtain a rule set with small in quantity and excellent in quality,an algorithm mining both positive and negative interesting association rules is proposed.In the algorithm,no contradictory and false association rules are generated by substitut ing confidence with confidence increment and citing an interesting measure.Moreover,the expectable and derivable rules in the discovered rule set are pruned.
作者 丁一 付弦
出处 《情报科学》 CSSCI 北大核心 2011年第6期939-942,960,共5页 Information Science
关键词 规则归约 覆盖运算 基规则 兴趣度 负关联规则 rules reduction cover operator key rule interestingness negative association rule
  • 相关文献

参考文献14

二级参考文献30

  • 1[1]Srikant R, Agrawal R. Mining quantitative association rules in large relation table[C]. In: Proceeding of the ACMSIGMOD Conference on Management of Data, Montreal, Canada, 1996. 1~12.
  • 2[2]Jiawei Han, Micheline Kamber. Data mining: concept and techniques[M]. Academic Press.2000.
  • 3[3]Fukuda T, Morimoto Y, Morishita S. Data mining using two-dimensional optimized association rules: scheme, algorithms and visualization[C]. In: Proceeding of the ACMSIGMOD Conference on Management of Data, Montreal, Canada, 1996. 13~24.
  • 4[4]Miller R, Yang Y. Association rules over interval data[C]. In: Proceeding of the ACMSIGMOD Conference on Management of Data, Tucson, USA, 1997. 1~10.
  • 5HAN J, PEI J, YIN Y. Mining Frequent patterns without candidate generation[A]. Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00) [ C], May 2000. 1 - 12.
  • 6AGRAWAL R , IMIELINSKI T , SWAMI A . Mining association rules between sets of items in large databases[ A]. Proc of the ACM SIGMOD Conference on Management of Data[ C]. Washington D C, May 1993.
  • 7BRIN S, MOTWANI R, ULLMAN J, et al. Dynamic Itemset Counting and Implication Rules for Market Basket Data[ A]. Proceedings of ACM SIGMOD International conference on Management of Data[ C], 1997. 255 -264.
  • 8TSUR D, ULLMAN J , AB1TEBOUL S , et al. Query Flocks : A Generalization of Association - Rule Mining[ A]. Proceedings of ACM SIGMOD International conference on Management of Data[ C],1998.1 - 12.
  • 9HIDBER C . Online Association Rule Mining [ A ] . Proceedings of ACM SIGMOD International conference on Management of Data[ C],1999. 145 - 156.
  • 10HAN JW, KAMBER M. DATA MINING Concepts and Techniques[ M]. Morgan Kaufmann Publishers, 2000.

共引文献142

同被引文献98

引证文献10

二级引证文献69

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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