摘要
约简是粗集理论的重要概念,由定义计算约简是一个典型的NP问题且由于约简的不唯一,往往最后获得的属性集并非是最好的属性。本文针对Rought set理论的属性约简进行了研究。研究了通过可辨识矩阵求得属性约简集,利用Rought set与灰色理论相结合,提出一种属性约简的启发式算法。实验证明可以获得约简集合中最有利的属性。
Reduction is an important concept in rough set theory, while computing reduction according to the definitions directly is a typical NP problem. This paper discusses the approaches for attribute reduction based on rough set theory. Following it studies the approaches to achieve attribute reduction set by applying recognized matrix, The text has researehed how to get attribute reductions through Discernibility matrix, combine Rough sets and gray theory, and puts forward a new heuristics algorithm for attribute reduction. The effectiveness of the result obtained is demonstrated by an example.
出处
《科技信息》
2007年第27期61-61,63,共2页
Science & Technology Information
