Dominance-based rough sets using indexed blocks as granules

Authors:
Chien-Chung Chan;Gwo-Hshiung Tzeng
Affiliations:
Department of Computer Science, University of Akron, Akron, OH and Department of Information Communications, Kainan University, Luchu, Taoyuan County, Taiwan;Department of Business and Entrepreneurial Administration, Kainan University, Luchu, Taoyuan County, Taiwan and Institute of Management of Technology, National Chiao Tung University, Hsinchu, Taiw ...
Venue:
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Year:
2008

Citing 2
Cited 2

Rough sets

Communications of the ACM
Incremental versus non-incremental rule induction for multicriteria classification

Transactions on Rough Sets II

Computing Approximations of Dominance-Based Rough Sets by Bit-Vector Encodings

RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
On definability of sets in dominance-based approximation space

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dominance-based rough set introduced by Greco et al. is an extension of Pawlak's classical rough set theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes satisfying upward and downward union properties. This paper introduces a formulation of approximation spaces based on multiple criteria decision tables by using the concept of indexed blocks, which are sets of objects indexed by pairs of decision values. The approximations of sets of decision classes are formulated in terms of exclusive neighborhoods of indexed blocks.We show that the set of indexed blocks with exclusive neighborhoods forms a partition on the universe of objects when approximating preference ordered decision classes with upward and downward union properties. Examples are given to illustrate presented concepts.