Deriving weights in multiple-criteria decision making with support vector machines

• Emilio Carrizosa ^[1]
  1. [1] Universidad de Sevilla

     Universidad de Sevilla

     Sevilla, España

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 14, Nº. 2, 2006, págs. 399-424
• Idioma: inglés
• DOI: 10.1007/bf02837570
• Enlaces
  • Texto completo (pdf)
• Resumen

  • A key problem in Multiple-Criteria Decision Making is how to measure the importance of the different criteria when just a partial preference relation among actions is given. In this note we address the problem of constructing a linear score function (and thus how to associate weights of importance to the criteria) when a binary relation comparing actions and partial information (relative importance) on the criteria are given. It is shown that these tasks can be done viaSupport Vector Machines, an increasingly popular Data Mining technique, which reduces the search of the weights to the resolution of (a series of) nonlinear convex optimization problems with linear constraints. An interactive method is then presented and illustrated by solving a multiple-objective 0–1 knapsack problem. Extensions to the case in which data are imprecise (given by intervals) or intransitivities in strict preferences exist are outlined.