TY - GEN
T1 - Discernibility-Matrix Method Based on the Hybrid of Equivalence and Dominance Relations
AU - LI, Yan
AU - ZHAO, Jin
AU - SUN, Na-Xin
AU - WANG, Xi-Zhao
AU - ZHAI, Jun-Hai
N1 - This work is supported by NSFC (No.60903088), Natural Science Foundation of Hebei Province (No.F2009000227, A2010000188, F2010000323), 100-Talent Programme of Hebei Province (CPRC002),key project of Educational Department of Hebei Province (ZD2010139), and Hong Kong PolyU grant A-PJ18.
PY - 2011
Y1 - 2011
N2 - The attribute set of some information systems is composed of both regular attributes and criteria. In order to obtain information reduction of this type of information systems, equivalence relation should be defined on the regular attributes and dominance relation on the criteria. Firstly, suppose condition attributes are criteria and decision attributes are regular attributes, dominance-equivalence relation is introduced,and the Discernibility-Matrix (DM) method of reduct generation is developed and compared with the attribute significance method. Secondly, when condition attributes are the hybrid of regular attributes and criteria, equivalence-dominance relation is then defined and Discernibility-Matrix approach of reduction generation is also provided.The effectiveness of this method is shown by both theoretical proof and illustrative example.
AB - The attribute set of some information systems is composed of both regular attributes and criteria. In order to obtain information reduction of this type of information systems, equivalence relation should be defined on the regular attributes and dominance relation on the criteria. Firstly, suppose condition attributes are criteria and decision attributes are regular attributes, dominance-equivalence relation is introduced,and the Discernibility-Matrix (DM) method of reduct generation is developed and compared with the attribute significance method. Secondly, when condition attributes are the hybrid of regular attributes and criteria, equivalence-dominance relation is then defined and Discernibility-Matrix approach of reduction generation is also provided.The effectiveness of this method is shown by both theoretical proof and illustrative example.
KW - Attribute significance
KW - Discernibility matrix
KW - Dominance relation
KW - Equivalence relation
KW - Postitive domian Reduction
UR - http://www.scopus.com/inward/record.url?scp=79960299140&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-21881-1_37
DO - 10.1007/978-3-642-21881-1_37
M3 - Conference paper (refereed)
AN - SCOPUS:79960299140
SN - 9783642218804
T3 - Lecture Notes in Computer Science
SP - 231
EP - 239
BT - Rough Sets, Fuzzy Sets, Data Mining and Granular Computing : 13th International Conference, RSFDGrC 2011, Proceedings
A2 - KUZNETSOV, Sergei O.
A2 - ŚLĘZAK, Dominik
A2 - HEPTING, Daryl H.
A2 - MIRKIN, Boris G.
PB - Springer Berlin Heidelberg
T2 - 13th International Conference on Rough Sets, Fuzzy Sets and Granular Computing, RSFDGrC 2011
Y2 - 25 June 2011 through 27 June 2011
ER -