| 极小极大规则学习及在决策树规则简化中的应用 |
| |
| 引用本文： | 王军 张庆杰. 极小极大规则学习及在决策树规则简化中的应用[J]. 计算机研究与发展, 1998, 35(9): 806-809 |
| |
| 作者姓名： | 王军 张庆杰 |
| |
| 作者单位： | [1]中国科学院计算技术研究所 [2]中央财经大学信息系 |
| |
| 摘 要： | 文中在粗糙集理论中的约简概念的启发下提出极小规则和极大规则的概念及极小极大规则学习。
|
| 关 键 词： | 机器学习 粗糙集 数据库 知识发现 决策树规则 |
MINIMAL AND MAXIMAL RULES LEARNING AND ITS APPLICATION TO SIMPLIFYING DECISION TREE RULES |
| |
| Wang Jun,Zhang Qingjie ,Li Shuang,and Shi Zhongzhi. MINIMAL AND MAXIMAL RULES LEARNING AND ITS APPLICATION TO SIMPLIFYING DECISION TREE RULES[J]. Journal of Computer Research and Development, 1998, 35(9): 806-809 |
| |
| Authors: | Wang Jun Zhang Qingjie Li Shuang and Shi Zhongzhi |
| |
| Affiliation: | Wang Jun,Zhang Qingjie *,Li Shuang,and Shi Zhongzhi |
| |
| Abstract: | The notions of minimal rule and maximal rule,especially the latter,are addressed in the light of the notion of reduction from rough set.And then a new learning algorithm called minimal and maximal rules learning is proposed.It can be used as a post processing to simplify the rules generated by decision tree induction,which currently is the most efficient classification method in KDD.The empirical result illustrates that the final decision tree rules simplified by the new method are considerably simpler than before. |
| |
| Keywords: | machine learning rough set knowledge discovery in databases |
| 本文献已被 CNKI 维普 等数据库收录！ |
