|
| 基于Rough集实现判定树归纳分类算法的简化 |
| Rough set based to simplify the decision tree class algorithm |
| |
| DOI：10.3969/j.issn.1671-5322.2004.03.008 |
| 中文关键词: Rough集 属性约简 判定树 数据挖掘 |
| 英文关键词: Rough Set attribute reduction decision tree data mining |
| 基金项目: |
|
| 摘要点击次数: 4362 |
| 全文下载次数: 3772 |
| 中文摘要: |
| Rough集理论提供了一种新的处理不精确、不完全与不相容知识的数学方法,在决策表中快速、有效地挖掘出缺省规则.本文将Rough集属性约简应用到判定树归纳分类方法中, 明显优化判定树,简化数据挖掘的过程. |
| 英文摘要: |
| Rough Set theory is a new mathematical method to deal with imprecise incomplete and inconsistent data. It can mine default rules efficiently and effectively from decision table. In this paper, we introduce attribute reduction based on Rough sets into decision tree class algorism to simplify the process of data mining. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |