计算机科学与探索 ›› 2010, Vol. 4 ›› Issue (5): 436-444.DOI: 10.3778/j.issn.1673-9418.2010.05.006

• 学术研究 • 上一篇    下一篇

决策表属性约简集的增量式更新算法*

官礼和1, 2, 3, 王国胤1, 2+   

  1. 1. 西南交通大学 信息科学与技术学院, 成都 610031
    2. 重庆邮电大学 计算机科学与技术研究所, 重庆 400065
    3. 重庆交通大学 光电与信息技术研究所, 重庆 400074
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-05-11 发布日期:2010-05-11
  • 通讯作者: 王国胤

An Incremental Updating Algorithm for Attribute Reduction Set of Decision Tables*

GUAN Lihe1,2,3, WANG Guoyin1,2+   

  1. 1. School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China
    2. Inst. of Comp. Sci. and Tech., Chongqing University of Posts and Telecommunications, Chongqing 400065, China
    3. Inst. of Optoelectronic and Information Technology, Chongqing Jiaotong University, Chongqing 400074, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-05-11 Published:2010-05-11
  • Contact: WANG Guoyin

摘要: 针对动态变化的决策表, 研究了属性约简集的动态更新问题。在详细分析新增对象的所有可能情况的基础上, 提出一种基于分辨矩阵元素集的属性约简集增量式更新算法。该算法根据新增对象的不同情况快速更新分辨矩阵元素集, 依据分辨矩阵元素集中增加和减少的元素有效地更新原属性约简集, 快速得到新的最小属性约简。最后, 通过5个UCI的数据集验证了算法的有效性。

关键词: 粗糙集, 属性约简, 分辨矩阵, 增量式

Abstract: The dynamic updating algorithm of attribute reduction set is discussed in the dynamic decision tables. Some different situations are analyzed when new objects are added to the old decision table, and an incremental updating algorithm for attribute reduction set based on the discernibility matrix element set is proposed. In the algorithm, the discernibility matrix element set could be updated quickly. Thus, the old attribute reduction set can be updated effectively by the changes of discernibility matrix element set, and the new minimum attribute reduction can be got quickly. At last, the correctness and effectiveness of the algorithm on 5 real datasets are demonstrated.

Key words: rough set, attribute reduction, discernibility matrix, incremental

中图分类号: