期刊文献+

A general approach to attribute reduction in rough set theory 被引量:2

A general approach to attribute reduction in rough set theory
原文传递
导出
摘要 The concept of a consistent approximation representation space is introduced. Many types of information systems can be treated and unified as consistent approximation representation spaces. At the same time, under the framework of this space, the judgment theorem for determining consistent attribute set is established, from which we can obtain the approach to attribute reductions in information systems. Also, the characterizations of three important types of attribute sets (the core attribute set, the relative necessary attribute set and the unnecessary attribute set) are examined. The concept of a consistent approximation representation space is introduced. Many types of information systems can be treated and unified as consistent approximation representation spaces. At the same time, under the framework of this space, the judgment theorem for determining consistent attribute set is established, from which we can obtain the approach to attribute reductions in information systems. Also, the characterizations of three important types of attribute sets (the core attribute set, the relative necessary attribute set and the unnecessary attribute set) are examined.
出处 《Science in China(Series F)》 2007年第2期188-197,共10页 中国科学(F辑英文版)
基金 Major State Basic Research Development Program of China (973 Program) (Grant No. 2002CB312200) the National Natu-ral Science Foundation of China (Grant Nos. 60673096 and 60373078)
关键词 rough sets attribute reduction information systems approximation representation spaces rough sets, attribute reduction, information systems, approximation representation spaces
  • 相关文献

参考文献1

二级参考文献10

  • 1Polkowski L, Tsumoto S, Lin T Yet al . Rough set methods and applications[ M]. Berlin: Physica Verlag,2000.
  • 2Hang Jiye, Qu K S, Xu Z B. Attribute reduction in information systems[J]. Theory and Practice of System Engineering,2001;21(12):76 - 80.
  • 3Nguyen H S, Stezak D. Approximation reducts and association rules correspondence and complexity results[J].In: Zhong N, Skowron A, Oshuga S et al . Proceedings of RSFDGrC'99, Yamaguchi, Japan. LNAI 1711,1999;137 - 145.
  • 4Skowron A, Rauszer C. The discemibillty matrices and functions in information systems[A]. In: Slowinskl R et al.Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory[C]. Ktuwer Academic Publishers, 1992 ; 331 - 362.
  • 5Pawlak Z, Rough sets[ J ]. International journal of computer and information sciences, 1982; 11 : 341 - 356.
  • 6Pawlak Z, Rough sets. Theoretical aspects of reasoning about data[ M]. Boston: Kluwer Academic Publishers,1991.
  • 7Zhang W X, Wu W Z, Liang J Y, Li D Y. Theory and methods of rough sets[M]. Beijing: Science Press,2001.
  • 8Kryszkiewicz M. Comparative study of alternative type of knowledge reduction in insistent systems[J]. International Joural of Intelligent Systems, 2001 ; 16:105 - 120.
  • 9Zhang W X, Mi J S, Wu W Z. Knowledge reduction in inconsistent objective information systems[J]. Chinese Journal of Computer, 2002 ; 26 ( 1 ) : 12 - 17.
  • 10张梅,李怀祖,张文修.Fuzzy信息系统的Rough集理论[J].模糊系统与数学,2002,16(3):44-49. 被引量:12

共引文献16

同被引文献6

引证文献2

二级引证文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部