Multiple criteria sorting methods based on support vector machines

Download

index.pdf

Date

2010

Author

Duman, Aslı

Metadata

Show full item record

Item Usage Stats

118
views

80
downloads

This study addresses sorting problems with predefined ordinal classes. We develop a new method based on Support Vector Machine (SVM) model, which is mainly used for nominal binary or multi-class classification processes. In the proposed method, the SVM model is extended to include the preferences of the decision maker and the ordinal relationship between classes in sorting problems. New sets of constraints are added to the SVM model. We demonstrate the performance of the proposed method through several data sets. We compare the results with those of classical SVM model and UTADIS method, a well-known multiple criteria sorting method. We also analyze the effect of feature space mapping by Kernel Trick utilization on the results.

Subject Keywords

Kernel functions.

URI

http://etd.lib.metu.edu.tr/upload/12612863/index.pdf
https://hdl.handle.net/11511/20331

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

An interactive probabilistic approach to multi-criteria sorting BUGDACI, Asli Gul; KOKSALAN, Murat; Ozpeynirci, Selin; Serin, Yaşar Yasemin (2013-10-01) This article addresses the problem of sorting alternatives evaluated by multiple criteria among preference-ordered classes. An interactive probabilistic sorting approach is developed in which the probability of an alternative being in each class is calculated and alternatives are assigned to classes keeping the probability of incorrect assignments below a specified small threshold value. The decision maker is occasionally required to place alternatives to classes. The probabilities for unassigned alternativ...
Kernel probabilistic distance clustering algorithms Özkan, Dilay; İyigün, Cem; Department of Industrial Engineering (2022-7) Clustering is an unsupervised learning method that groups data considering the similarities between objects (data points). Probabilistic Distance Clustering (PDC) is a soft clustering approach based on some principles. Instead of directly assigning an object to a cluster, it assigns them to clusters with a membership probability. PDC is a simple yet effective clustering algorithm that performs well on spherical-shaped and linearly separable data sets. Traditional clustering algorithms fail when the data ...
Multidimensional assortment problem with an application Tripathy, A; Süral, Haldun; Gerchak, Y (1999-05-01) This paper addresses the discrete multidimensional assortment problem. Assortment issues arise frequently in practice as an important design and inventory problem which simultaneously seeks the answers to two related questions: (a) Which items (or sizes of a product) to stock? (b) How much of each to stock? its discrete multidimensional version concerns itself with choosing sizes from among a discrete set of possible ones with each size being characterized by more than one dimension. Our research is motivat...
Generalized bent functions with perfect nonlinear functions on arbitrary groups Yılmaz, Emrah Sercan; Özbudak, Ferruh; Department of Cryptography (2012) This thesis depends on the paper ‘Non-Boolean Almost Perfect Nonlinear Functions on Non- Abelian Groups’ by Laurent Poinsot and Alexander Pott and we have no new costructions here. We give an introduction about character theory and the paper of Poinsot and Pott, and we also compare previous definitions of bent functions with the definition of the bent function in the paper. As a conclusion, we give new theoretical definitions of bent, PN, APN ana maximum nonlinearity. Moreover, we show that bent and PN func...
Characterisation and enumeration of a class of semi bent quadratic Boolean functions KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01) In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...

Citation Formats

A. Duman, “Multiple criteria sorting methods based on support vector machines,” M.S. - Master of Science, Middle East Technical University, 2010.