Skip to main content
Log in

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

  • Published:
TOP Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Benayoun R., Montgolfier J. de, Tergny J. and Laritchev O. (1971). Linear Programming and Multiple Objective Functions: STEP Method (STEM).Mathematical Programming 1, 366–375.

    Article  Google Scholar 

  • Burges C. (1998). A Tutorial on Support Vector Machines for Pattern Recognition”.Data Mining and Knowledge Discovery 2, 121–167.

    Article  Google Scholar 

  • Carrizosa E. and Conde E. (2002). A Fractional Model for Locating Semi-Desirable Facilities on Networks.European Journal of Operational Research 136, 67–80.

    Article  Google Scholar 

  • Carrizosa E., Conde E., Fernández F.R. and Puerto J. (1995). Multi-Criteria Analysis with Partial Information about the Weighting Coefficients.European Journal of Operational Research 81, 291–301.

    Article  Google Scholar 

  • Carrizosa E. and Fliege J. (2002). Generalized Goal Programming: Polynomial methods and applications.Mathematical Programming 93, 281–303.

    Article  Google Scholar 

  • Cortes C. and Vapnik V. (1995). Support Vector Networks.Machine Learning 20, 273–297.

    Google Scholar 

  • Crammer K. and Singer Y. (2001). Pranking with Ranking. Proceedings of the Fourteenth Annual Conference on Neural Information Processing Systems, 641–647.

  • Cristianini N. and Shawe-Taylor J. (2000).An Introduction to Support Vector Machines. Cambridge University Press.

  • Freund Y., Iyer R., Schapire R.E. and Singer Y. (1998). An Efficient Boosting Algorithm for Combining Preferences. Proceedings of the Fifteenth International Conference on Machine Learning, Madison, Wisconsin, USA, 170–178.

  • Fung G., Mangasarian O.L. and Shavlik J. (2001). Knowledge-Based Support Vector Machine Classifiers. Technical Report 01–09. Data Mining Institute, University of Winsconsin.

  • Hastie T., Tibshirani R. and Friedman J. (2001).The Elements of Statistical Learning. Springer.

  • Herbrich R., Graepel T. and Obermayer K. (2000). Large Margin Rank Boundaries for Ordinal Regression. In: Smola A., Barlett P., Schölkopf B. and Schuurmans D. (eds.),Advances in Large Margin Classifiers. MIT Press, 115–132.

  • Hiriart-Urruty J.B. and Lemaréchal C. (1996).Convex Analysis and Minimization Algorithms, vol. 2. Springer.

  • Mangasarian O.L. (1965). Linear and Nonlinear Separation of Patterns by Linear Programming.Operations Research 13, 444–452.

    Article  Google Scholar 

  • Mangasarian O.L. (2000). Generalized Support Vector Machines. In: Smola A., Barlett P., Schölkopf B. and Schuurmans D. (eds.),Advances in Large Margin Classifiers. MIT Press, 135–146.

  • Plastria F. and Carrizosa E. (2001). Gauge Distances and Median Hyperplanes.Journal of Optimization Theory and Applications 110, 173–182.

    Article  Google Scholar 

  • Roy B. (1968). Classement et Choix en Présence de Points de Vue Multiples (la Méthode Electre).Revue Française d'informatique et de Recherche Opérationnelle 2, 57–75.

    Google Scholar 

  • Smola A. and Schölkopf B. (2002).Learning with kernels. MIT Press.

  • Steuer R.E. and Choo E.U. (1983). An Interactive Weighted Tchebycheff Procedure for Multiple Objective Programming.Mathematical Programming 26, 326–344.

    Article  Google Scholar 

  • Suykens J.A.K. and Vandewalle J. (1999). Least Squares Support Vector Machine Classifiers.Neural Processing Letters 9, 293–300.

    Article  Google Scholar 

  • Suykens J.A.K., Van Gestel T., Brabanter J. De, De Moor B. and Vandewalle J. (2002).Least Squares Support Vector Machines. World Scientific Publishing.

  • Vapnik V.N. (1998).Statistical Learning Theory. Wiley.

  • Vapnik V.N. (2000).The Nature of Statistical Learning. Springer.

  • Zhu J., Rosset S., Hastie T. and Tibshirani R. (2003).L 1 Norm Support Vector Machines. Technical report, Standford University.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Partially supported by grants MTM2005-09362-103-01 of MEC, Spain, and FQM-329 of Junta de Andalucía, Spain. Part of this work has been written while the author visited the Department of Statistics and Decision Support Systems of the Universität Wien.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carrizosa, E. Deriving weights in multiple-criteria decision making with support vector machines. TOP 14, 399–424 (2006). https://doi.org/10.1007/BF02837570

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02837570

Key words

AMS subject classification

Navigation