| 基于属性约简的决策表算法 |
| |
| 引用本文： | 张群峰,王静红,李笔.基于属性约简的决策表算法[J].河北省科学院学报,2005,22(3):6-9. |
| |
| 作者姓名： | 张群峰 王静红 李笔 |
| |
| 作者单位： | 河北大学数学与计算机学院,河北,保定,071002;河北师范大学计算机教学部,河北,石家庄,050091;河北师范大学商学院,河北,石家庄,050091 |
| |
| 摘 要： | Rough Set理论通过属性约简和决策规则约简,达到发掘知识并简化知识的目的。本文首先给出了属性重要性的度量方法,然后对条件属性的简化进行了阐述,最后,讨论了一致决策表最小算法的三类优化问题。并通过一个实例证明了这种算法。
|
| 关 键 词： | 粗糙集 决策表 属性约简 NP-hrd问题 |
| 文章编号： | 1001-9383(2005)03-0006-04 |
| 修稿时间： | 2005年3月25日 |
Decision table algorithm based on attribute reduction |
| |
| ZHANG Qun-feng,WANG Jing-hong,LI Bi.Decision table algorithm based on attribute reduction[J].Journal of The Hebei Academy of Sciences,2005,22(3):6-9. |
| |
| Authors: | ZHANG Qun-feng WANG Jing-hong LI Bi |
| |
| Institution: | ZHANG Qun-feng~1,WANG Jing-hong~2,LI Bi~3 |
| |
| Abstract: | Rough Set explore knowledge and simplify knowledge through attribute simple and decision rule simple.But it is one NP-hardness for attribute simple, one that is to attribute invite simple and decision rule invite simple to can only realize through the heuristic algorithm.The method of measuring of the attribute importance is provided at first, then the simplifying of condition attribute is explained, three optimal problems of the minimal algorithms of a decision table are investigated, and this algorithm through a instance has been proved. |
| |
| Keywords: | Rough sets Decision table Reducts Attribute reduction NP-hardness |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
