计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (27): 168-171.DOI: 10.3778/j.issn.1002-8331.2008.27.054

• 数据库、信号与信息处理 • 上一篇    下一篇

序信息系统属性约简的一种启发式算法

桂现才   

  1. 湛江师范学院 数学与计算科学学院,广东 湛江 524048
  • 收稿日期:2007-11-14 修回日期:2008-02-03 出版日期:2008-09-21 发布日期:2008-09-21
  • 通讯作者: 桂现才

Heuristic algorithm for attribute reduction in ordered information systems

GUI Xian-cai   

  1. School of Mathematics and Computational Science,Zhanjiang Normal College,Zhanjiang,Guangdong 524048,China
  • Received:2007-11-14 Revised:2008-02-03 Online:2008-09-21 Published:2008-09-21
  • Contact: GUI Xian-cai

摘要: 在序信息系统中引入了知识的信息量和知识粒度的概念,得到了它们的若干性质和定理。证明了在知识约简过程中,信息量的变化趋势是递减的;利用信息量的概念,定义了属性的重要性,并以属性重要性作为启发信息,提出了一种基于信息量的属性约简启发式算法,该算法的时间复杂度为O(|A|3|U|2);最后通过例子说明,该算法能得到序信息系统的一个约简。

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.