Attribute reduction in ordered information systems based on evidence theory
Attribute reduction in ordered information systems based on evidence theory
复制标题
DOI：
10.1007/s10115-009-0248-5
复制
发表时间：
2010-10
影响因子：
2.7
通讯作者：
Wei-Hua Xu;Xiao-yan Zhang;Jian-min Zhong;Wenxiu Zhang
中科院分区：
文献类型：
--
作者：
Wei-Hua Xu;Xiao-yan Zhang;Jian-min Zhong;Wenxiu Zhang
属性约简是粗糙集理论中的重要问题之一。然而，在现实世界中，由于各种因素的影响，很多信息系统都是基于优势关系而不是传统的等价关系。属性的排序性质在这些系统中起着至关重要的作用。为了从系统中获取简明的决策规则，需要进行属性约简。研究基于证据理论的有序信息系统的属性约简问题。在有序信息系统中引入了似然和信念相容集以及似然和信任约简的概念。证明了似然一致集一定是一致集，属性集是信任约简当且仅当它是有序信息系统中的经典约简。
Attribute reduction is one of the most important problems in rough set theory. However, in real-world lots of information systems are based on dominance relation in stead of the classical equivalence relation because of various factors. The ordering properties of attributes play a crucial role in those systems. To acquire brief decision rules from the systems, attribute reductions are needed. This paper deals with attribute reduction in ordered information systems based on evidence theory. The concepts of plausibility and belief consistent sets as well as plausibility and belief reducts in ordered information systems are introduced. It is proved that a plausibility consistent set must be a consistent set and an attribute set is a belief reduct if and only if it is a classical reduction in ordered information system.