Indexed by:
Abstract:
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.
Keyword:
Reprint Author's Address:
Email:
Source :
KNOWLEDGE AND INFORMATION SYSTEMS
ISSN: 0219-1377
Year: 2010
Issue: 1
Volume: 25
Page: 169-184
2 . 0 0 8
JCR@2010
2 . 8 2 2
JCR@2020
ESI Discipline: COMPUTER SCIENCE;
JCR Journal Grade:2
CAS Journal Grade:3
Cited Count:
WoS CC Cited Count: 48
SCOPUS Cited Count: 65
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 3
Affiliated Colleges: