| 序信息系统属性约简的一种启发式算法 |
| |
| 引用本文： | 桂现才.序信息系统属性约简的一种启发式算法[J].计算机工程与应用,2008,44(27):168-171. |
| |
| 作者姓名： | 桂现才 |
| |
| 作者单位： | 湛江师范学院 数学与计算科学学院，广东 湛江 524048 |
| |
| 基金项目： | 湛江师范学院校科研和教改项目 |
| |
| 摘 要： | 在序信息系统中引入了知识的信息量和知识粒度的概念，得到了它们的若干性质和定理。证明了在知识约简过程中，信息量的变化趋势是递减的；利用信息量的概念，定义了属性的重要性，并以属性重要性作为启发信息，提出了一种基于信息量的属性约简启发式算法，该算法的时间复杂度为O（|A|3|U|2）；最后通过例子说明，该算法能得到序信息系统的一个约简。
|
| 关 键 词： | 粗糙集 序信息系统 属性约简 信息量 知识粒度 优势关系 |
| 收稿时间： | 2007-11-14 |
| 修稿时间： | 2008-2-3
|
Heuristic algorithm for attribute reduction in ordered information systems |
| |
| GUI Xian-cai.Heuristic algorithm for attribute reduction in ordered information systems[J].Computer Engineering and Applications,2008,44(27):168-171. |
| |
| Authors: | GUI Xian-cai |
| |
| Affiliation: | School of Mathematics and Computational Science，Zhanjiang Normal College，Zhanjiang，Guangdong 524048，China |
| |
| Abstract: | By introducing the concept of information quantity and knowledge granularity to ordered information system,several properties and theorems are gained.In the process of attribute reduction,the author proves that the information quantity is monotone decreasing.Using information quantity to defined the significance of attribute.With the significance of attribute as heuristic information,a heuristic algorithm based on information quantity for reduction of attribute is presented.The time complexity of this algorithm is O(|A|3|U|2).Finally,the experimental results show that this algorithm can find the reduction of an ordered information system. |
| |
| Keywords: | rough set ordered information systems attribute reduction information quantity knowledge granularity dominance relations |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
