节点文献
粗糙集属性约简算法研究
Rough Set Attribute Reduction Discovery
【摘要】 粗糙集理论是一个新的处理不确定性问题的数学工具,属性约简是粗糙集理论的核心问题之一。但求解最优约简已被证明是一个NP-hard问题。基于属性重要度的启发式算法在属性约简中应用的较多,文中分别介绍了基于区分矩阵、基于相关矩阵和基于信息量的属性约简算法,对其思想进行了剖析和总结。
【Abstract】 Rough set theory is a new math theory that processes the non-accurate question. Attr- bute reduction is one of the most important problems of rough set. But it has been proved that fin- ding the minimal reduction is a NP-hard question problem. Heuristic algorithm based on the attri- bute importance had been wide range applied in the reduction. This text introduces some reduction algorithms which based discernibility matrix, relation matrix and information quantity, and analy- is and summarize the thinking of these algorithms.
- 【文献出处】 电脑知识与技术(学术交流) ,Computer Knowledge and Technology(Academic Exchange) , 编辑部邮箱 ,2007年01期
- 【分类号】TP301.6
- 【被引频次】6
- 【下载频次】369