期刊文献+

冗余关联规则删减技术研究综述

The survey of non-redundant association rules research
下载PDF
导出
摘要 关联规则是数据挖掘的重要研究内容之一,而传统算法生成的关联规则之间存在着大量的冗余规则,这使得用户分析和利用这些规则变得十分困难。为了帮助用户分析,可以采用各种技术来有效地减少大量冗余的规则。本文介绍了冗余关联规则的概念,冗余关联规则删减的算法,结合当前的研究成果分析冗余关联规则的发展趋势。 The discovery of association rules is an important research topic in data mining, but the traditional association rules discovery algorithm produces too many redundant rules, which makes it difficult for users to analyze and makes use of these rules. To facilitate analysis, the number of redundant rules can be reduced sig- nificantly by techniques. This paper introduces the concept of redundant rules and the non-redundant rules al- gorithm, analyzes developing directions of redundant rules using currently research fruit.
出处 《山东轻工业学院学报(自然科学版)》 CAS 2007年第4期31-33,共3页 Journal of Shandong Polytechnic University
关键词 数据挖掘 关联规则 频繁项集 冗余性 data mining association rules frequent itemsets redundancy
  • 相关文献

参考文献5

二级参考文献31

  • 1Agrawal R, Imielinski T, Swami A. Mining Association Rules Between Sets of Items in Large Databascs[C]. Washington D.C.: Proceedings of thc ACM SIGM-OD Conference on Management of Data ,1993.
  • 2Srikant R, Agrawal R.Mining Quantiative Association Rules in Large Relational Tables[C]. Proceedings of the ACM SIGMOD Conference on Management of Data, 1996.
  • 3Aggarwal C C,Yu P S.Online Generation of Association Roles [A].Orlando, Florida: Proceeding of the International Conference of Data Engineering [C], 1998:402--411.
  • 4Agrawal R, Srikant R. Fast Algorithms for Mining Association Rules in Large databases [A]. Santiago, Chile: Proceedings of the 20th International Conference on Very Large Databases [C],1994.
  • 5Aggarwal C C,Proc Int Conference Data Engineering,1998年,402页
  • 6Park J S,Proc of ACMSIGMOD Int Conference on Management of Data,1995年,175页
  • 7AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases[ A]. In: Buneman P, Jajodia S, eds. Proc. of the ACM SIGMOD Conf. on Management of Data (SIGMOD'93) [ C] . New York: ACM Press, 1993. 207-216.
  • 8BRIN S, MOTWANI R, SILVERSTEIN C. Beyond Market Baskets:Generalizing Association Rules to Correlations [ A]. In Proc1997ACM-SIGMOD Int Conf Management of Data ( SIGMOD'97) [ C],1997. 265 - 276.
  • 9AGRAWAL R, STRIKANT R. Fast Algorithms for Mining Association Rules in Large Databases[ A]. In Research Report RJ 9839, IBM Almaden Research Center[ C]. San Jose, California, 1994.
  • 10AGGARWAL CC, SUN Z, YU PS. Online Generation of Profile Association Rules[ A]. Proc KDD Com[ C], 1998.

共引文献37

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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