Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Probabilistic and interactive approach to multiple criteria sorting
Download
index.pdf
Date
2015
Author
Mutlu, Sinem
Metadata
Show full item record
Item Usage Stats
228
views
59
downloads
Cite This
In this thesis, we develop a method in order to assign alternatives that are evaluated by multiple criteria into preference ordered classes probabilistically. Our motivation is that; when there are large sets of alternatives, placement could be realized in a fast and effective way based on a reasonable misclassification ratio. We assume that the underlying utility function of Decision Maker (DM) is additive. We first ask DM to place reference alternatives into the classes. We develop an interactive probabilistic sorting approach that calculates the probability of each alternative being in each class. If all the alternatives can be placed into a class at the same time by evaluating probabilities, the procedure ends, if not DM is asked to place an unassigned alternative into a class and the procedure is repeated by utilizing this new information. The procedure ends when all the alternatives are placed. We test the performance of the algorithms on four different problems. The performance of algorithm is evaluated by number of misclassified alternatives, expected number of misclassified alternatives, and number of alternatives that are asked to the DM for placement.
Subject Keywords
Multiple criteria decision making.
,
Decision making.
,
Probabilities.
,
Algorithms.
URI
http://etd.lib.metu.edu.tr/upload/12618827/index.pdf
https://hdl.handle.net/11511/24712
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
An interactive approach for placing alternatives in preference classes
Köksalan, Mustafa Murat; Ulu, C (2003-01-16)
In this paper, we consider the multiple criteria decision making problem of partitioning alternatives into preference classes. We develop an interactive procedure based on the assumption that the decision maker (DM) has a linear utility function. The approach requires the DM to place an alternative in a preference class from time to time. Based on the preference information derived from the DM's placement as well as from dominance and linearity, we try to place other alternatives. We present results on the ...
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 probabilistic approach to multi criteria sorting problem
Buğdacı, Aslı Gül; Köksalan, Murat; Department of Industrial Engineering (2009)
We aim to classify alternatives evaluated in multiple criteria among preference ordered classes assuming an underlying additive utility function. We develop a probabilistic classification method by calculating the probability of an alternative being in each class. We assign alternatives to classes based on threshold probabilities. We require the decision maker to place an alternative to a class when no alternatives satisfy the required thresholds. We find new probabilities for unassigned alternatives in the...
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...
A preference based multi response decision tree approach for quality improvement in manufacturing
Dolgun, Leman Esra; Ipekçi, Arif Ilker; Köksal, Gülser (2011-12-01)
This paper presents a multi response decision tree (DT) approach to find the process conditions that yield products with desirable quality characteristics (QCs). We propose several criteria aggregation functions to convert responses (QCs) into an aggregated value. DT modeling is applied on the resulting aggregated values to decide on the process levels. Decision rules obtained separately for each QC can help in predicting the levels of QC values at these process levels thereafter. © 2011 IADIS.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Mutlu, “A Probabilistic and interactive approach to multiple criteria sorting,” M.S. - Master of Science, Middle East Technical University, 2015.