| 基于分辨矩阵的快速完备约简算法 |
| |
| 引用本文： | 王加阳,高灿.基于分辨矩阵的快速完备约简算法[J].计算机工程与应用,2008,44(8):92-94. |
| |
| 作者姓名： | 王加阳 高灿 |
| |
| 作者单位： | 中南大学 信息科学与工程学院，长沙 410083 |
| |
| 摘 要： | 对分辨矩阵求核过程进行改进与扩展，给出了一种以属性频度作为启发式信息计算最小约简快速完备方法。与其它最小约简算法相比，该算法在很大程度上降低了算法的复杂度，提高了算法的效率。
|
| 关 键 词： | 粗糙集 分辨矩阵 分辨信息集 最小约简 |
| 文章编号： | 1002-8331（2008）08-0092-03 |
| 收稿时间： | 2007-07-10 |
| 修稿时间： | 2007-09-17 |
Fast and complete algorithm for reduction based on discernibility matrix |
| |
| WANG Jia-yang,GAO Can.Fast and complete algorithm for reduction based on discernibility matrix[J].Computer Engineering and Applications,2008,44(8):92-94. |
| |
| Authors: | WANG Jia-yang GAO Can |
| |
| Affiliation: | College of Information Science and Engineering，Central South University，Changsha 410083，China |
| |
| Abstract: | Through improving and extending the process of computing core,the minimal reduction algorithm based on attribute frequency heuristic information are put forward.Comparing with other minimal reduction algorithms,further improving the efficiency of algorithm.Finally,An example is be given to explain the validity of the new algorithm. |
| |
| Keywords: | rough set discernihility matrix discernihility information set minimal reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
