计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (30): 163-166.DOI: 10.3778/j.issn.1002-8331.2008.30.050

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

基于划分贴近度的不完备信息系统属性约简

徐久成,孟慧丽,郭林鹏   

  1. 河南师范大学 计算机与信息技术学院,河南 新乡 453007
  • 收稿日期:2007-11-30 修回日期:2008-02-25 出版日期:2008-10-21 发布日期:2008-10-21
  • 通讯作者: 徐久成

Partition close-degree based attribute reduction under incomplete information system

XU Jiu-cheng,MENG Hui-li,GUO Lin-peng   

  1. School of Computer and Information Technology,Henan Normal University,Xinxiang,Henan 453007,China
  • Received:2007-11-30 Revised:2008-02-25 Online:2008-10-21 Published:2008-10-21
  • Contact: XU Jiu-cheng

摘要: 在不完备信息系统中,通过引入划分贴近度,对不完备信息系统中属性的重要性进行了定义。针对不完备信息表和不完备决策表提出了两个新的基于划分贴近度的属性约简算法,两个算法的时间复杂度均为O(m2n2)。通过实例说明,这两个算法能分别得到不完备信息表的约简和不完备决策表的相对约简。

关键词: 粗糙集, 不完备信息系统, 划分贴近度, 属性约简

Abstract: Introduce partition close-degree into incomplete information system and redefine the importance of attributes,then based on partition close-degree,two new attribute reduction algorithms are proposed which can deal with incomplete information system.The first can deal with incomplete data table,the second can deal with incomplete decision table.The time complexity of two algorithms is O(m2n2).The validity of the two algorithms is shown through an example.

Key words: rough sets, incomplete information system, partition close-degree, attribute reduction