作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2011, Vol. 37 ›› Issue (24): 52-54.

• 软件技术与数据库 • 上一篇    下一篇

基于优势关系的启发式属性约简算法

廖 帆 1,滕书华 2,邵世雷 1   

  1. (1. 中国人民解放军理工大学通信工程学院,南京 210007;2. 国防科学技术大学电子科学与工程学院,长沙 410073)
  • 收稿日期:2011-05-16 出版日期:2011-12-20 发布日期:2011-12-20
  • 作者简介:廖 帆(1986-),男,硕士研究生,主研方向:数据挖掘,约简算法;滕书华,博士;邵世雷,副教授
  • 基金资助:
    国家自然科学基金资助项目(40901216)

Heuristic Algorithm for Attribute Reduction Based on Dominance Relation

LIAO Fan 1, TENG Shu-hua 2, SHAO Shi-lei 1   

  1. (1. Institute of Communications Engineering, PLA University of Science&Technology, Nanjing 210007, China; 2. Institute of Electronic Science and Engineering, National University of Defense Technology, Changsha 410073, China)
  • Received:2011-05-16 Online:2011-12-20 Published:2011-12-20

摘要: 根据优势原理,提出一种具有明确粗糙集理论含义的指标——优势度,用于度量序目标信息系统的协调程度。在证明优势度粒化单调性的基础上,给出属性集重要性度量函数,提出一种基于优势度的序目标信息系统启发式约简算法。该算法与经典粗糙集理论约简有相同的理论基础,易于理解。应用结果表明,该算法适用于优势关系下目标信息系统的知识发现。

关键词: 粗糙集, 属性约简, 优势关系, 不协调信息系统, 属性重要性

Abstract: A new uncertainty measure, such as dominance degree is proposed in ordered objective information systems based on dominance principle, and an explicit theoretical meaning of rough set is given to the dominance degree which can be used to measure the inconsistence of objective information system. The granulation monotonicity of dominance degree is proved, based on which a new measure of attribution importance is designed. An heuristic reduct algorithm in objective information system is provided based on dominance relation. An example illustrates the validity of this algorithm, and results show that the algorithm has the same theoretical foundation with classical reduct algorithm in rough set theory, and it is easily understood. The algorithm provides an important theoretical basis for knowledge discovery in ordered objective information systems.

Key words: rough set, attribute reduction, dominance relation, inconsistent information system, attribute importance

中图分类号: