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

Authors:
Chien-Chung Chan;Gwo-Hshiung Tzeng
Affiliations:
Department of Computer Science, University of Akron, Akron, USA 44325-4003 and Department of Information Science and Applications, Asia University, Wufeng, Taiwan 41354;Department of Business and Entrepreneurial Administration, Kainan University, Luchu, Taiwan County 338 and Institute of Management of Technology, National Chiao Tung University, Hsinchu, Taiwan 30 ...
Venue:
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Year:
2008

Citing 4
Cited 1

Rough sets

Communications of the ACM
An Algorithm for Induction of Decision Rules Consistent with the Dominance Principle

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Dominance-based rough sets using indexed blocks as granules

RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Incremental versus non-incremental rule induction for multicriteria classification

Transactions on Rough Sets II

Qualitative and quantitative combinations of crisp and rough clustering schemes using dominance relations

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a mechanism for computing approximations of Dominance-Based Rough Sets (DBRS) by bit-vector encodings. DBRS was introduced by Greco et al. as an extension of Pawlak's classical rough sets theory by using dominance relations in place of equivalence relations for approximating sets of preference ordered decision classes. Our formulation of dominance-based approximation spaces is based on the concept of indexed blocks introduced by Chan and Tzeng. Indexed blocks are sets of objects indexed by pairs of decision values where approximations of sets of decision classes are defined in terms of exclusive neighborhoods of indexed blocks. In this work, we introduced an algorithm for updating indexed blocks incrementally, and we show that the computing of dominance-based approximations can be accomplished more intuitively and efficiently by encoding indexed blocks as bit-vectors. In addition, bit-vector encodings can simplify the definitions of lower and upper approximations greatly. Examples are given to illustrate presented concepts.