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

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

基于粒计算的属性约简算法

赵 敏,罗 可,秦 哲   

  1. 长沙理工大学 计算机与通信工程学院,长沙 410076
  • 收稿日期:2007-11-28 修回日期:2008-02-03 出版日期:2008-10-21 发布日期:2008-10-21
  • 通讯作者: 赵 敏

Attribute reduction algorithm based on granular computing

ZHAO Min,LUO Ke,QIN Zhe   

  1. School of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410076,China
  • Received:2007-11-28 Revised:2008-02-03 Online:2008-10-21 Published:2008-10-21
  • Contact: ZHAO Min

摘要: 粒计算是一种基于问题概念空间划分的新的智能计算理论和方法,不相容决策表是粗糙集理论研究的一个重点。利用粗糙集中的等价关系来构建粒子,给出了决策表系统的粒子分解方法及在粒表示下以属性重要性作为启发信息的属性约简算法。实验结果表明该算法不仅具有高效性,而且能处理大型决策表。

关键词: 粗糙集, 粒计算, 属性约简, 属性重要性

Abstract: Granular computing is a new intelligent computing theory and method based on issue partition concepts.Inconsistent decision table is an important aspect in rough set theory.Using the equivalent relation in rough set to construct particle,this paper offers decompounds method of particle,furthermore gives the heuristic information in attribute reduction algorithm based on attribute importance.At last,experimental result shows that the new algorithm is not only very efficient but also can treat with large decision table.

Key words: rough set, granular computing, attribute reduction, attribute importance