期刊文献+

一种基于约束的区间合并算法

Research on the Algorithm of Constraint-based Interval Combining
下载PDF
导出
摘要 数据挖掘中数量关联规则挖掘的关键是连续属性离散化问题,本文基于规则约束,以兴趣度为依据,对数量关联规则的区间合并算法进行了研究。 The discretization of continuous attribute is the key problem to quantitative association rules mining in Data Mining.In this paper,the algorithm was researched based on rules constraint according to interestness.
出处 《吉林工程技术师范学院学报》 2009年第9期68-70,共3页 Journal of Jilin Engineering Normal University
关键词 数据挖掘 数量关联规则 约束 兴趣度 data mining quantitative association rules constraint interestness
  • 相关文献

参考文献4

  • 1Agrawal R,Srikant R. Fast Mgrorithms for Mining Association Rules [ C ]. Proc of the 20thVLDB Conference, Santiago, Chile, 1994.
  • 2Mendelzon A,Ozsoyoglu Z, eds. Proceeding of the 15th ACM Symposium on Principles of Database Systema [ M ]. New York : ACM Press, 1996.
  • 3Hart J, Pei J, Yin Y. Mining Frequent Patterns without Candidate[ C ]. Proc of 2000 ACMSIGMOD on Management of Data, Dallas, USA ,2000.
  • 4Miller R, Yang Y. Association rules over interval data[ C]. Proceeding of the ACMSIGMOD Conference on Management of Data, Tucson, USA, 1997.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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