摘要
属性约简是粗糙集理论研究的核心内容之一.在序信息系统中引入信息量和属性重要性,给出它们与属性约简之间的关系.针对序信息系统提出了一种基于信息量和属性重要性的属性约简算法,讨论了算法的时间复杂度.实例证明了该算法的有效性.
One of the focuses of rough set theory is attribute reduction. In an ordered information system, the information quality and significance of attributes are defined. Relationships between them and attribute reductions are investigated, based on which, a heuristic algorithm for obtain attribute reductions is presented, and the time complexity of the algorithm is also shown. Finally, the validity of the algorithm have been depicted by an practical example.
出处
《系统工程理论与实践》
EI
CSSCI
CSCD
北大核心
2010年第9期1679-1683,共5页
Systems Engineering-Theory & Practice
基金
国家自然科学基金(10901025,60703117)
中央高校基本科研业务费专项基金(CHD2009JC028)
长安大学基础研究支持计划专项基金
关键词
粗糙集
序信息系统
信息量
属性重要性
属性约简
rough set
ordered information system
information quality
significance of attribute
attribute reduction
