期刊文献+

有序规则挖掘问题的研究 被引量:1

Research of mining ordering rules
下载PDF
导出
摘要 许多关于数据挖掘和机器学习的研究都集中于分类的研究,然而现实世界涉及到的不仅仅是分类问题,比如对象的排序问题。将有序规则的挖掘问题加以形式化,挖掘有序规则即要找到各个属性产生的排序与对象整体排序之间的关系。提出了有序信息表的形式化概念,然后提出了通过将有序信息表转化为一个二值信息表,继而挖掘有序规则的方法。 Many real world problems deal with ordering objects instead of classifying objects, though most research in machine learning and data mining has been focused on the latter. The problem of mining ordering rules as finding association between orderings of attribute values and the overall ordering of objects is formulated. For mining ordering rules, the notion of information tables is proposed, then the approach to mining ordering rules is gaven by transforming the ordered information table into a binary information table.
作者 赛英 赛煜
出处 《计算机工程与设计》 CSCD 2004年第7期1063-1064,共2页 Computer Engineering and Design
基金 山东省教育厅科技计划基金项目(J02F06)。
关键词 数据挖掘 机器学习 知识发现 有序信息表 有序规则 data mining knowledge discovery in database ordered information table ordering rule
  • 相关文献

参考文献7

  • 1Cohen W W, Schapire R E, Singer Y. Learning to order things [M]. Advances in Neural Information Processing Systems,1998.10.
  • 2Pawlak Z, Slowinski R. Rough set approach to multi-attribute decision analysis [J]. European Journal of Operational Research,1994, 72: 443-359.
  • 3Tsumoto S. Modelling medical diagnostic rules based on rough sets [M]. Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence 1424, Berlin: Springer-Verlag,1998. 475-482.
  • 4Yao Y Y, Zhong N. An analysis of quantitative measures associated with rules [C]. Proceedings of PAKDD'99, Beijing: Springer, 1999. 479-488.
  • 5Greco S, Matarazzo B, Slowinski R. Rough approximation of a preference relation by dominance relations [J]. European Journal of Operational Research, 1999, 117: 63-83.
  • 6Pawlak Z. Rough Sets [M]. Theoretical Aspects of Reasoning about Data, Dordrecht: Kluwer Academic Publishers, 1991.
  • 7Quinlan J R. C4.5: Program for machine learning [M]. San Mar teo: Morgan Kaufmann Publishers, 1993.

同被引文献7

  • 1张保威,李明.基于Rough Set的属性值约简算法研究[J].计算机工程与设计,2006,27(13):2324-2326. 被引量:2
  • 2HANJia-wei KamberMicheline 范明.数据挖掘:概念与技术[M].北京:机械工业出版社,2001..
  • 3Iwinski T B. Ordinal information system Ⅰ [ J ]. Bulletin of the Pohsh Academy of Science, Mathematics, 1988 : 467-475.
  • 4Greco S, Matarazzo B, Slowinski R. Rough approximation of a preference relation by dominance relations [ J ]. European Journal of Operational Research, 1999:63-83.
  • 5Sai Y, Yao Y Y, Zhong N. Data analysis and mining in ordered information tables[C]. San Jose:Proceedings of IEEE International Conference on Data Mining,2001:497-504.
  • 6JOHN W T LEE, DA-ZHONG LIU. Induction of ordinal decision tree[C]. Beijing: Proceedings of the First International Conference on Machine Learning and Cybernetics, 2002: 4-5.
  • 7陆爱国,刘三阳,王珏,江莉.基于粗糙集的区间值属性决策表的有序规则获取[J].计算机工程与应用,2004,40(9):194-196. 被引量:4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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