Dominance-Based Rough Sets Using Indexed Blocks as Granules
Dominance-based rough set introduced by Greco et al.is an extension of Pawlaks 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 up-ward and downward union properties.Examples are given to illustrate presented concepts.
Rough sets Dominance-based rough sets Multiple crite-ria decision analysis (MCDA) Classification sorting Indexed blocks Granule
Chien-Chung Chan Gwo-Hshiung Tzeng
Department of Computer Science,University of Akron,Akron,OH,44325-4003,USA; Department of Informatio Department of Business and Entrepreneurial Administration,Kainan University,No.1 Kainan Road,Luchu,T
国际会议
成都
英文
244-251
2008-05-17（万方平台首次上网日期，不代表论文的发表时间）