| 信息系统属性约简的快速算法 |
| |
| 引用本文： | 廖毅强,桂现才.信息系统属性约简的快速算法[J].计算机工程与设计,2008,29(18). |
| |
| 作者姓名： | 廖毅强 桂现才 |
| |
| 作者单位： | 1. 广东轻工职业技术学院,广东,广州,510300
2. 湛江师范学院,数学与计算科学学院,广东,湛江,524048 |
| |
| 基金项目： | 湛江师范学院校科研和教改项目 |
| |
| 摘 要： | 对目前已有的信息系统属性约简的启发式算法进行了分析,认为它们的时间复杂度不太理想.以快速缩小搜索空间为目的,先利用划分U/A对信息系统进行化简.设计了一个新的度量属性重要性的计算公式,并给出了该公式的递归计算方法.然后给出了一个时间复杂度为max{O(A‖U|),O|A|2|U/A|)}的快速属性约简算法,最后,实例及实验结果表明了该算法的有效性.
|
| 关 键 词： | 信息系统 属性重要性 属性约简 算法复杂度 |
Quick algorithm for attribute reduction in information system |
| |
| LIAO Yi-qiang,GUI Xian-cai.Quick algorithm for attribute reduction in information system[J].Computer Engineering and Design,2008,29(18). |
| |
| Authors: | LIAO Yi-qiang GUI Xian-cai |
| |
| Affiliation: | LIAO Yi-qiang1,GUI Xian-cai2(1.Guangdong Industry Technical College,Guangzhou 510300,China,2.School of Mathematics , Computational Science,Zhanjiang Normal College,Zhanjiang 524048,China) |
| |
| Abstract: | The heuristic algorithm for attribute reduction in the information system that has arisen at present is analyzed.It's time com-plexity is not good.For reducing searching space as quickly as possible,partition U/A is used to simplify information system.Furthermore,a new formula for measuring the importance of attribution is designed,and the recursive calculating method of the formula is proposed.Then a quick algorithm for attribution reduction is provided.The time complexity of the provided algorithm is max{... |
| |
| Keywords: | information system attribute importance attribute reduction algorithm complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
