Inducing robust decision rules from rough approximations of a preference relation

被引:0
作者
Slowinski, R [1 ]
Greco, S
机构
[1] Poznan Univ Tech, Inst Comp Sci, PL-60965 Poznan, Poland
[2] Polish Acad Sci, Syst Res Inst, PL-01447 Warsaw, Poland
[3] Univ Catania, Fac Econ, I-95129 Catania, Italy
来源
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004 | 2004年 / 3070卷
关键词
multicriteria decision; knowledge discovery; rough sets; decision rules; Lorenz dominance;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Given a data set describing a number of pairwise comparisons of reference objects made by a decision maker (DM), we wish to find a set of robust decision rules constituting a preference model of the DM. To accomplish this, we are constructing rough approximations of the comprehensive preference relation, called outranking, known from these pairwise comparisons. The rough approximations of the outranking relation are constructed using the Lorenz dominance relation on degrees of preference on particular criteria for pairs of reference objects being compared. The Lorenz dominance is used for its ability of drawing more robust conclusions from preference ordered data than the Pareto dominance. The rough approximations become a starting point for mining "if..., then... " decision rules constituting a logical preference model. Application of the set of decision rules to a new set of objects gives a fuzzy outranking graph. Positive and negative flows are calculated for each object in the graph, giving arguments about its strength and weakness. Aggregation of both arguments by the Net Flow Score procedure leads to a final ranking. The approach can be applied to support multicriteria choice and ranking of objects when the input information is a set of pairwise comparisons of some reference objects.
引用
收藏
页码:118 / 132
页数:15
相关论文
共 50 条
[21]   A DNA-Based Algorithm for Minimizing Decision Rules: A Rough Sets Approach [J].
Kim, Ikno ;
Chu, Yu-Yi ;
Watada, Junzo ;
Wu, Jui-Yu ;
Pedrycz, Witold .
IEEE TRANSACTIONS ON NANOBIOSCIENCE, 2011, 10 (03) :139-151
[22]   Dynamic and Updating Multigranulation Decision-Theoretic Rough Approximations When Adding or Deleting Objects [J].
Wang, Hong ;
Guan, Jingtao .
IEEE ACCESS, 2021, 9 :123648-123659
[23]   Incremental updating approximations in confidential dominance relation based rough set [J].
Gou G.-L. ;
Wang G.-Y. .
Kongzhi yu Juece/Control and Decision, 2016, 31 (06) :1027-1031
[24]   A comparison of two kinds of definitions of rough approximations based on a similarity relation [J].
Abo-Tabl, E. A. .
INFORMATION SCIENCES, 2011, 181 (12) :2587-2596
[25]   A multi-factorial decision-making model for deduction of rules in rough sets [J].
Wang, JS ;
Li, MQ .
PROCEEDINGS OF THE 3RD WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-5, 2000, :383-386
[26]   Rough approximations of bipolar soft sets by soft relations and their application in decision making [J].
Shabir, Muhammad ;
Mubarak, Asad ;
Naz, Munazza .
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (06) :11845-11860
[27]   A study of preference relation for the mould bidding strategy based on rough set [J].
Li, Guangming ;
Liu, Zhengkun ;
Zheng, Li Xuan .
MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-3, 2011, 295-297 :982-986
[28]   Fuzzy rough sets and multiple-premise gradual decision rules [J].
Greco, S ;
Inuiguchi, M ;
Slowinski, R .
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2006, 41 (02) :179-211
[29]   A hybrid of conceptual clusters, rough sets and attribute oriented induction for inducing symbolic rules [J].
Jiang, QS ;
Abidi, SSR .
Proceedings of 2005 International Conference on Machine Learning and Cybernetics, Vols 1-9, 2005, :5573-5578
[30]   Distinguishing Vagueness from Ambiguity in Rough Set Approximations [J].
Greco, Salvatore ;
Matarazzo, Benedetto ;
Slowinski, Roman .
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2018, 26 :89-125