| 一种基于知识粗糙度的知识约简算法 |
| |
| 引用本文： | 李学文,王小刚.一种基于知识粗糙度的知识约简算法[J].西安文理学院学报,2009,12(2):40-43. |
| |
| 作者姓名： | 李学文 王小刚 |
| |
| 作者单位： | 北方民族大学,基础教学部,宁夏,银川,750021
|
| |
| 基金项目： | 教育部科学技术研究重点项目，宁夏自然科学基金，北方民族大学校级科研项目 |
| |
| 摘 要： | 给出了知识的粗糙度概念，得到了知识粗糙度随着知识粒度变小而单调递减的结论，并通过知识的粗糙度对属性的重要性进行定义．在此基础上，提出了基于知识粗糙度的知识约简算法，该算法的时间复杂性为O（1｜A｜^3×｜U｜^2）．通过例子分析表明，该算法是有效的．
|
| 关 键 词： | 粗糙集 知识粗糙度 知识约简 时间复杂性 |
A Roughness of Knowledge-Based Algorithm for Reduction of Knowledge |
| |
| LI Xue-wen,WANG Xiao-gang.A Roughness of Knowledge-Based Algorithm for Reduction of Knowledge[J].Journal of Xi‘an University of Arts & Science:Natural Science Edition,2009,12(2):40-43. |
| |
| Authors: | LI Xue-wen WANG Xiao-gang |
| |
| Institution: | ( School of Mathemstics and Computer Sdence, Ningxia University, Yinchuan 750021, China) |
| |
| Abstract: | In this paper,the roughness of knowledge is denncd and it dccreases monotonously as thegranulahty of knowledge become smaller is proVed. The signincance of atthbute is defined through theroughness of knowledge. Accordingly,a algohthm for reduction of knowlcdge bascd on the roughness ofknowledge is giVen ,of which time complexityis O（1 ｜A｜^3 × ｜ U｜^2 ）. It nproves that the algorithm ise effectivethrough example analysis. |
| |
| Keywords: | rough set roughness ofknowledgc reduction ofknowlcdgc ： timc complexity |
| 本文献已被 维普 万方数据 等数据库收录！ |
