期刊文献+

基于VPRS的ID3算法改进 被引量:4

Improvement on ID3 algorithms based on variable precision rough set
下载PDF
导出
摘要 在变精度粗糙集模型的基础上,通过定义近似分类质量来对条件属性进行选择,在ID3算法的基础上生成决策树,实现了对ID3算法的改进,使分类速度加快,并且有效地解决了含噪数据的分类问题。 On the basis of variable precision rough set model, choices of condition attributions are chosen through defining approximate quality of classification, then decision tree combined with ID3 algorithms is produced, the improvement on ID3 algorithms is made, the progress in classification speed is achieved, and the classification nroblem about noisy data is effectively solved.
出处 《陕西理工学院学报(自然科学版)》 2007年第3期38-41,54,共5页 Journal of Shananxi University of Technology:Natural Science Edition
基金 河南省教育厅自然科学研究资助项目(2006520010)
关键词 变精度粗糙集 ID3算法 近似分类质量 variable precision rough set ID3 algorithms approximate quality of classification
  • 相关文献

参考文献6

  • 1Quinlan J R. Induction of Decision Tree [J]. Machine Learning,1986,1 (1) :81-106.
  • 2Pawlak Z. Rough Sets [ J ]. International Journal of Computer and Information Sciences, 1982, (11 ):341-356.
  • 3Ziarko W. Variable Rough Sets Model[J]. Journal of Computer and System Sciences, 1993, (46) :39-59.
  • 4朱红.基于粗集的ID3算法研究[J].湘潭大学自然科学学报,2006,28(1):33-36. 被引量:5
  • 5Jiawei Hall. Michdine Kamber [ M]. Morgan Kaufmann Publishers,2001. 190.
  • 6程玉胜,张佑生,胡学钢.变精度粗集模型中变精度值的估计[J].重庆大学学报(自然科学版),2006,29(9):122-125. 被引量:3

二级参考文献16

  • 1刘清.Rough集及Rough推理[M].北京:科学出版社,2001..
  • 2Tom M.Mitchell.Machine Learning[M].Beijing:China Machine Press,1996.
  • 3Pawlak Z.Vagueness and uncertainty//A Rough Set Perspective[J].Computational Intelligence,1995,11(2):65.
  • 4PAWLAK Z.Rough Sets:Theoretical Aspects of Reasoning About Data[M].Boston:Kluwer Academic Publishers,1991.
  • 5DOMINIK SLEZAK,WOJCIECH ZIARKO.The Investigation of the Bayesian Rough Set Model[J].International Journal of Approximate Reasoning,2005,40:81-91.
  • 6ZIARKO W.Variable Precision Rough Set Model[J].Journal of Computer and System Sciences,1993,46(1):39-59.
  • 7BEYNON M.Reducts Within the Variable Precision Rough Sets Model:a Further Investigation[J].European Journal of Operational Research,2001,134:592-605.
  • 8MI JUSHENG,WU WEIZHI,ZHANG WENXIU.Approaches to Knowledge Reduction Based on Variable Precision Rough Sets Model[J].Information Sciences,2004,159:255-272.
  • 9王国胤.Rough集及Rough推理[M].西安:西安交通大学出版社,2001.
  • 10CHENG YUSHENG,ZHANG YOUSHENG,HU XUEGANG.The Relationships Between Variable Precision Value and Knowledge Reduction Based on Variable Precision Rough Set Model[C].RSKT2006,Berlin:Springer-Verlag,Lecture Notes in Computer Science(to appear),2006.

共引文献6

同被引文献55

  • 1高俊,施伯乐.快速关联规则挖掘算法研究[J].计算机科学,2005,32(3):200-201. 被引量:10
  • 2孙洁,周庆敏,常志玲.变精度粗糙集模型在决策树构造中的应用[J].计算机工程与应用,2007,43(7):195-197. 被引量:6
  • 3田斐,崔世林.一种基于最优近邻交叉的遗传算法[J].陕西理工学院学报(自然科学版),2007,23(2):25-28. 被引量:6
  • 4罗秋瑾,马锐.基于粗集和熵的多变量决策树的构造算法[J].计算机应用,2007,27(7):1708-1710. 被引量:5
  • 5Agrawal R,Imielinski T,Swami A.Mining association rules between sets of items in large databases[A].In:Proceedings of 1993 ACM SIGMOD International Conference Management of Data[C].Washington,1993.207-216.
  • 6Han J,Kamber M.Data Mining:Concepts and Techniques[M].Beijing:High Education Press,2001.
  • 7Agrawal R,Srikant R.Fast algorithms for mining association rules[A].In:J Bocca,M Jarke,C Zaniolo eds.Proc.of the 20th Conf.on Very Large DataBases(VLDB′94)[C].Santiago:Morgan Kaufmann,1994.487-499.
  • 8Han J,Pei J.Freespan:Frequent pattern-projected sequential pattern mining:[Technical Report CMPT2000-06][M].Simon Fraser University,2000.6-12.
  • 9Akutsu.T,Halldorson.M.M.On the approximation of largest common subtrees and largest common point sets[J].Theoretical Computer Science,2000,233:33-50.
  • 10Gupta.A.,Nishimura.N.Finding largest subtrees and smallest supertrees[J].Algorithmica,1998,21:183-210.

引证文献4

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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