Linear approximations and extensions to distance based multicriteria sorting methods

Download

index.pdf

Date

2022-8-26

Author

Taş, Hasan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

146
views

99
downloads

Multicriteria sorting is the assignment of alternatives to predefined preference ordered classes. In this thesis, linear approximations to nearest centroid and distance-based multicriteria sorting methods are studied. Three studies are conducted. The first study is the linearization of a nearest centroid based method. In the second study, the nearest centroid classifier method is investigated under monotonic centroids and a new linear programming model is developed based on the feasibility and redundancy conditions. In the third study, a new linear octagonal approximation for nonlinear oval contours of distance functions is developed and analyzed. It is shown that the new approximation is consistent with distance functions. Due to the elimination of nonlinearities in mathematical programs, solution time significantly decreases. It is also observed that the classification accuracy increased in the studied models.

Subject Keywords

Multicriteria sorting, Distance functions, Linear approximation, Nearest centroid classifier, Distance based sorting

URI

https://hdl.handle.net/11511/98773

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...
A Mathematical programming evaluation approach for multiple criteria sorting problems Civelek, Merve; Karasakal, Esra; Department of Operational Research (2019) Multiple criteria sorting problem is to assign alternatives, evaluated according to multiple criteria, into predefined preference ordered classes. In this study, a new distance metric based sorting method is developed to solve multiple criteria sorting problems without specifying class thresholds between preference-ordered classes. The aim of the proposed method is to assign each alternative to one class or a set of possible adjacent classes considering the distance to class centroids. In the proposed metho...
A multiple criteria sorting approach based on distance functions Çelik, Bilge; Karasakal, Esra; İyigün, Cem; Department of Industrial Engineering (2011) Sorting is the problem of assignment of alternatives into predefined ordinal classes according to multiple criteria. A new distance function based solution approach is developed for sorting problems in this study. The distance to the ideal point is used as the criteria disaggregation function to determine the values of alternatives. These values are used to sort them into the predefined classes. The distance function is provided in general distance norm. The criteria disaggregation function is determined ac...
A Mathematical Programming Approach for Multiple Criteria Sorting Problems Civelek, Merve; Karasakal, Esra (2019-06-16) Multiple criteria sorting problem is to assign alternatives, evaluated according to multiple criteria, into predefined preference ordered classes. In this study, a new distance metric based sorting method is developed to solve multiple criteria sorting problems. The aim of the proposed method is to assign each alternative to one class or a set of possible adjacent classes. In the proposed method, centroids of the classes are estimated using sample preference set provided by the decision maker. Distance to t...
Redundant tasks in multitasking control of discrete event systems Schmidt, Klaus Verner (null; 2009-12-01) This paper addresses the control of multitasking DES that allow for dealing with liveness properties in the case where multiple classes of tasks have to be independently completed by the system. Colored marking generators (CMG) have been previously introduced as a model to consider multitasking control. The computational cost of the supervisor synthesis for multitasking DES grows with the number of classes of tasks. In this paper we investigate conditions under which removing tasks of the DES model does not...

Citation Formats

H. Taş, “Linear approximations and extensions to distance based multicriteria sorting methods,” M.S. - Master of Science, Middle East Technical University, 2022.