Mining Decision-Rule Preference Model from Rough Approximation of Preference Relation

  • Authors:
  • Roman Slowinski;Salvatore Greco;Benedetto Matarazzo

  • Affiliations:
  • -;-;-

  • Venue:
  • COMPSAC '02 Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 appliedto support multicriteria choice and ranking of actions when the input information is a ranking ofsome reference actions.