loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
26th Annual International Computer Software and Applications Conference
Mining Decision-Rule Preference Model from Rough Approximation of Preference Relation
Oxford, England
August 26-August 29
ISBN: 0-7695-1727-7
Roman Slowinski, Poznan University of Technology
Salvatore Greco, University of Catania
Benedetto Matarazzo, University of Catania
Given a ranking of actions evaluated by a set of evaluation criteria, we are constructing a rough approximation of the preference relation known from this ranking. The rough approximation of the preference relation is a starting point for mining "if…, then…" decision rules constituting a symbolic preference model. The set of rules is induced such as to be compatible with a concordance-discordance preference model used in well-known multicriteria decision aiding methods. Application of the set of decision rules to a new set of actions gives a fuzzy outranking graph. Positive and negative flows are calculated for each action in the graph, giving arguments about its strength and weakness. Aggregation of both arguments leads to a final ranking, either partial or complete. The approach can be applied to support multicriteria choice and ranking of actions when the input information is a ranking of some reference actions.
Citation:
Roman Slowinski, Salvatore Greco, Benedetto Matarazzo, "Mining Decision-Rule Preference Model from Rough Approximation of Preference Relation," compsac, pp.1129, 26th Annual International Computer Software and Applications Conference, 2002
Usage of this product signifies your acceptance of the Terms of Use.