首页 | 本学科首页   官方微博 | 高级检索  
     

决策树分类准确率极限的研究
引用本文:牛 琨,陈俊亮,张舒博. 决策树分类准确率极限的研究[J]. 计算机工程, 2007, 33(10): 222-224
作者姓名:牛 琨  陈俊亮  张舒博
作者单位:[1]北京邮电大学计算机科学与技术学院,北京100876 [2]中国电信北京研究院决策研究部,北京100035
摘    要:采用最大分类树作为分析经验风险与结构风险的工具,对决策树分类准确率极限进行了研究。针对决策树模型的分类效果难以客观评价的问题,讨论了决策树分类准确率极限的存在条件,给出了求出该极限的方法。以最大分类树作为分析工具,提出了在经验风险和结构风险4种分布条件下分类准确率极限是否存在的4个定理,并从机器学习理论和工程建模实践2个角度进行了讨论。实验验证了该理论的正确性。

关 键 词:决策树  分类准确率  极限  经验风险  结构风险
文章编号:1000-3428(2007)10-0222-03
修稿时间:2006-08-03

Research on Classification Accuracy Limit of Decision Tree
NIU Kun,CHEN Junliang,ZHANG Shubo. Research on Classification Accuracy Limit of Decision Tree[J]. Computer Engineering, 2007, 33(10): 222-224
Authors:NIU Kun  CHEN Junliang  ZHANG Shubo
Affiliation:1. School of Computer Science and Technology, Beijing University of Posts and Telecommunications, Beijing 100876 2. Department of Strategy Research, Beijing Research Institute of China Telecom., Beijing 100035
Abstract:Taking maximum classification tree as a tool to analyze empirical risk and structural risk, this paper addresses the problem of classification accuracy limit of decision tree. Aiming at the difficulty to estimate the classification effectiveness of decision tree externally, it discusses the existence condition of classification accuracy limit and presents the method to get it. It points out four theorems which demonstrate the existence of classification accuracy limit under four distribution conditions of empirical risk and structural risk with analysis from machine learning theory and practical modeling. The theorems are validated from experiments on ten public datasets.
Keywords:Decision tree   Classification accuracy   Limit   Empirical risk   Structural risk
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号