摘要
主要对RoughSet理论中的离散化问题进行了研究,提出了基于属性值重要性的离散化算法,利用文献[5]中不可分辩类的定义、属性重要性的讨论及属性约简的启发式算法,得到了一种离散化与属性约简相结合的启发式算法,并通过Delphi程序验证了该算法对UCI数据库的有效性。
This paper mainly discusses the attributes discretization in Rough Set theory. It begins with the algorithm based on the significance of the attributes value. Then it uses the results of references paper [ 5 ] , the undistributed class and the significance, meanwhile,a heuristic algorithm based on general core set for attribute reduction ;finally,the experiment shows that it can get better effect and it also shows the reduction results of UCI database using this algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2008年第14期152-154,共3页
Computer Engineering and Applications
基金
云南省教育厅青年科研基金项目(No.07Y11385)
关键词
粗糙集理论
离散化
属性约简
可辨识矩阵
不可分辨类
启发式算法
Rough Set theory
discretization
attribute reduction
discernibility matrix
undistributed class
a heuristic algorithm
