摘要
在对粗糙集理论进行深入研究的基础上,依据决策规则独立原则,提出了一种基于相似关系向量的不完备信息系统数据补齐算法,有效地解决了原有ROUSTIDA算法可能存在的决策规则矛盾问题。实例证明改进算法的填补正确率比ROUSTIDA算法高,具有更好的实用价值。
Based on a deep research of the rough set theory, an completing data algorithm of the incomplete information system based on similarity relation vector is proposed according to the decision rule independence principle. It can efficiently solve the potential contradiction between decision rules comparing with the original ROUSTIDA algorithm. A practical case proves that the completing accuracy rate is upper than ROUSTIDA algorithm’s, and the new algorithm has better practical value.
出处
《计算机工程与应用》
CSCD
2014年第13期133-136,共4页
Computer Engineering and Applications
基金
国家自然科学基金(No.60273043)
安徽省高校省级优秀青年人才基金(No.2011SQRL047)
安徽农业大学校青年科学基金(No.2009zr39)
关键词
粗糙集
不完备信息系统
相似关系向量
可辨识矩阵
rough set
Incomplete Information System (IIS)
similarity relation vector
distinct matrix