Attribute reduction in ordered information systems based on evidence theory
- 195 Downloads
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.
KeywordsAttribute reduction Consistent set Evidence theory Rough set Ordered information system
Unable to display preview. Download preview PDF.
- 5.Greco S, Matarazzo B, Slowinski R (1999) Rough approximation of a preference relation by dominance relation. ICS Research Report 16(96, Warsaw University of Technology; 1996 and in Eur J Oper Res 117): 63–83Google Scholar
- 6.Greco S, Matarazzo B, Slowinski R (1998) A new rough set approach to multicriteria and multiattribute classification. In: Polkowsik L, Skowron A (eds) Rough sets and current trends in computing (RSCTC’98). Lecture notes in Artificial Intelligence, vol 1424. Springer, Berlin, pp 60–67Google Scholar
- 7.Greco S, Matarazzo B, Slowinski R (1999) A new rough sets approach to evaluation of bankruptcy risk. In: Zopounidis X (eds) Operational tools in the management of financial risks. Kluwer, Dordrecht, pp 121–136Google Scholar
- 10.Greco S, Matarazzo B, Slowinski R (2007) Dominance-based Rough Set approach as a proper way of handling graduality in rough set theory. Transactions on Rough Sets VII. Lecture notes in computer science, 4400:36–52Google Scholar
- 19.Sai Y, Yao YY, Zhong N (2001) Data analysis and mining in ordered information tables. In: Proceeding of the 2001 IEEE international conference on data mining. IEEE Computer Society Press, pp 497–504Google Scholar
- 22.Skowron A, Graymala-Busse J (1994) From rough set theory to evidence theory. In: Yager RR, Fedrizzi M, Kacprzyk J (eds) Advance in the Dempster–Shafer theory of evidence. Wiley, New York, pp 193–236Google Scholar
- 23.Slezak D (1998) Searching for dynamic reducts in inconsistent decision tables. In: Proceedings of IPMU’ 98(Paris, France 2): 1362–1369Google Scholar
- 24.Susmaga R, Slowinski R, Greco S, Matarazzo B (2000) Generation of reducts and rules in multi-attribute and multi-criteria classification. Control Cybernet 4: 969–988Google Scholar
- 31.Xu WH, Shao MW, Zhang WX (2006) Knowledge reduction based on evidence reasoning theory in ordered information systems. Lect Notes Artif Intell 4092: 535–547Google Scholar
- 35.Zhang WX, Wu WZ, Liang JY, Li DY (2001) Theory and method of rough sets. Science Press, BeijingGoogle Scholar