| 基于可辨识矩阵的属性频率约简算法 |
| |
| 引用本文： | 任小康,吴尚智,马如云.基于可辨识矩阵的属性频率约简算法[J].兰州大学学报(自然科学版),2007,43(1):138-140. |
| |
| 作者姓名： | 任小康 吴尚智 马如云 |
| |
| 作者单位： | 西北师范大学数学与信息科学学院,甘肃 兰州 730070;西北师范大学数学与信息科学学院,甘肃 兰州 730070;西北师范大学数学与信息科学学院,甘肃 兰州 730070 |
| |
| 摘 要： | 阐述了粗糙集理论的基本概念,知识约简是粗糙集理论研究的核心内容之一,将可辨识矩阵中出现次数多少作为属性重要性的判断依据.算法求取的是所有约简结果中的某一个或某一些f当某两个条件属性出现频率相同时)结果,当信息系统的复杂程度较高时,其求解的复杂度大大小于原来的约简方法.
|
| 关 键 词： | 粗糙集理论 可辨识矩阵 属性约简 决策表 |
| 文章编号： | 0455-2059（2007）01-0138-03 |
| 修稿时间： | 2006-08-31 |
An algorithm of attribute frequency reduction based on discernibility matrix |
| |
| REN Xiao-kang,WU Shang-zhi,MA Ru-yun.An algorithm of attribute frequency reduction based on discernibility matrix[J].Journal of Lanzhou University(Natural Science),2007,43(1):138-140. |
| |
| Authors: | REN Xiao-kang WU Shang-zhi MA Ru-yun |
| |
| Institution: | College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China |
| |
| Abstract: | This paper expounds the basic conceptions of the rough sets theory, in which knowledge reduction is a very important topic. An algorithm which is based on the frequency of attribute is proposed in the discernibility matrix of an information system. The algorithm produces some result of all attribute reductions (when the attributes of two conditions appear at the same the frequency). Using the algorithm we can reduce the complexity of the original attribute reduction algorithm greatly and acquire the optimal decision-making rules of the information system. |
| |
| Keywords: | rough sets theory discernibility matrix attribute reduction decision table |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
