摘要
以属性在可分辨矩阵中出现的频率作为启发，对HORAFA算法做了一些改进。引入二进制可辨识矩阵，利用二进制可辨识矩阵求出相对核。以相对核为基础，依次加入属性重要度大的属性，直到不能再加。
The paper learns something from the frequency of attributes appeared in the discernibly matrix, and makes progress on the HORAFA. Lead binary discernibly matrix in, and make the discernibly function more simplify, and then find the core. The algorithm adds the most important attribute into the core until can＇t add anymore.
作者
张永平
李娜
ZHANG Yong-ping, LI Na （School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221008, China）
出处
《电脑知识与技术》
2009年第5期3524-3526,共3页
Computer Knowledge and Technology
关键词
粗糙集
属性约简
二进制可辨识矩阵
rough sets
attribute reduction
binary discernibly matrix
