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

基于变精度粗糙集的决策树优化算法研究
引用本文:常志玲,周庆敏.基于变精度粗糙集的决策树优化算法研究[J].计算机工程与设计,2006,27(17):3175-3177.
作者姓名:常志玲  周庆敏
作者单位:南京工业大学,信息科学与工程学院,江苏,南京,210009;南京工业大学,信息科学与工程学院,江苏,南京,210009
基金项目:江苏省高校自然科学基金
摘    要:应用变精度粗糙集理论,提出了一种利用新的启发式函数构造决策树的方法。该方法以变精度粗糙集的分类质量的量度作为信息函数,对条件属性进行选择。和ID3算法比较,本方法充分考虑了属性间的依赖性和冗余性,尤其考虑了训练数据中的噪声数据,允许在构造决策树的过程中划入正域的实例类别存在一定的不一致性,可简化生成的决策树,提高决策树的泛化能力。

关 键 词:变精度粗糙集  决策树  粗糙集  分类质量  ID3算法
文章编号:1000-7024(2006)17-3175-03
收稿时间:2005-07-06
修稿时间:2005-07-06

Method based on variable precision rough set to build decision tree
CHANG Zhi-ling,ZHOU Qing-min.Method based on variable precision rough set to build decision tree[J].Computer Engineering and Design,2006,27(17):3175-3177.
Authors:CHANG Zhi-ling  ZHOU Qing-min
Affiliation:College of Information Science and Engineering, Nanjing University of Technology, Nanjing 210009, China
Abstract:A new heuristic function to build decision trees based on variable precision rough set is proposed. The measure ofquahty ot classification acts as information function to select the condition attribute in this method. Compared with ID3 algorithm, dependency and redundancy between attributes are considered, especially noisy data of training sets. A certain inconsistency is allowed to exist in examples of the positive regions, so the decision trees is simplified and its extensive ability is improved.
Keywords:VPRS  decision tree  rough set  quality of classification  ID3 algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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