| 增量式的高效属性约简算法 |
| |
| 引用本文： | 王元珍,裴小兵. 增量式的高效属性约简算法[J]. 小型微型计算机系统, 2005, 26(11): 1983-1985 |
| |
| 作者姓名： | 王元珍 裴小兵 |
| |
| 作者单位： | 华中科技大学,计算机学院数据库与多媒体研究所,湖北,武汉,430074 |
| |
| 基金项目： | 科技部电子政务关键技术及应用系统研究项目的资助,项目编号：2001BA110B01. |
| |
| 摘 要： | 属性约简是Rough集理论的核心内容之一，计算所有的属性约简已经被证明是NP完全问题．在深入研究Rough集理论的基础上，仔细分析了对象集的增加与属性约简的关系，给出了增量式属性约简的判定定理，从而提供了计算所有属性约简的增量式算法，分析了算法的时间复杂度．理论分析和实验结果表明，该约简算法在效率上较现有的算法有显著提高．
|
| 关 键 词： | Rough集 属性约简 增量式算法 |
| 文章编号： | 1000-1220（2005）11-1983-03 |
| 收稿时间： | 2004-05-09 |
| 修稿时间： | 2004-05-09 |
Efficient Algorithm of Increment for Attribute Reductions |
| |
| WANG Yuan-zhen,PEI Xiao-bing. Efficient Algorithm of Increment for Attribute Reductions[J]. Mini-micro Systems, 2005, 26(11): 1983-1985 |
| |
| Authors: | WANG Yuan-zhen PEI Xiao-bing |
| |
| Affiliation: | WANG Yuan-zhen, PEI Xiao-bing (Institute of Database and Multimedia, Department of Computer Science,Huazhong University of Science |
| |
| Abstract: | Attribute reduction is one of the basic contents,it is NP-complete problem to calculate all attribute reductions. Based on in-depth study of rough set theory,the relation between increase of objects and attribute reductions are analyzed carefully,a judgement theorem for attribute reductions of rough set with respect to increase a new object is obtained ,from which an incremental algorithm is proposed and its time complexity is analyzed. Theoretical analysis and experimental results show that the algorithm is much more efficient in comparison with those existing algorithm. |
| |
| Keywords: | rough set attribute reduction incremental algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
