An interactive sorting approach based on information theoretic measure

2019-06-16
In this study, we develop an interactive approach for sorting alternatives. We assume that the preferences of the decision maker are consistent with an additive function. We assign worst and best possible categories for each alternative and narrow down these category ranges using mixed integer programming (MIP) iteratively. We utilize binary variables to assign the alternatives for which the classes are not known exactly. We incorporate the worst and best possible category information to the MIPs whenever new information is obtained. In each iteration, we find the assignment frequency of alternatives for each category using the values of the binary variables gathered from the MIPs and calculate the probability of an alternative to be placed in a category based on these frequencies. We then use the information theoretic measure, entropy, in the selection of the alternative that will be placed to a category by the decision maker. The entropy concept fits well to our measurement of uncertainty about the categories of the alternatives since the aim is to ask the decision maker an alternative that will yield much information to the decision process. We test the performance of our approach on an example problem from the literature and the results show that it works well.
25th International Conference on Multiple Criteria Decision Making (16 - 21 Haziran 2019)

Suggestions

A hybrid swarm intelligence algorithm for simultaneous feature selection and clustering
Geren, Hasan; Özdemirel, Nur Evin; Department of Industrial Engineering (2022-6-20)
In this study, we address the feature selection and clustering problems by using a hybrid swarm intelligence approach. We assume that the number of clusters is known, clusters can be of any shape and have different densities, but there are no outliers or noise. The data set may have high dimensionality and redundant features. We propose a swarm intelligence algorithm, namely ACOVNS, which is a hybridization of Ant Colony Optimization (ACO) and Variable Neighborhood Search (VNS). We utilize the ACO mechanism...
An interactive ranking-based multi-criteria choice algorithm with filtering: Applications to university selection
Karakaya, Gülşah (Orta Doğu Teknik Üniversitesi (Ankara, Turkey), 2019-6)
In this study, we develop an interactive algorithm to converge to the most preferred alternative of a decision maker (DM) among a set of discrete alternatives. The algorithm presents a limited number of alternatives to the DM and collects preference ranking of them iteratively. The preferences are modeled by a flexible and realistic preference function. To improve the performance, the alternatives presented are determined by a filtering method. We compare our algorithm with benchmark algorithms on nume...
A realistic success criterion for discourse segmentation
Yondem, MT; Üçoluk, Göktürk (2003-01-01)
In this study, compared to the existing one, a more realistic evaluation method for discourse segmentation is introduced. It is believed that discourse segmentation is a fuzzy task [Pas96]. Human subjects may agree on different discourse boundaries, with high agreement among them. In the existing method a threshold value is calculated and sentences that marked by that many subjects are decided as real boundaries and other marks are not been considered. Furthermore automatically discovered boundaries, in cas...
Interactive Approaches to Multiple Criteria Sorting Problems: Entropy-Based Question Selection Methods
Özarslan, Ali; Karakaya, Gülşah (2022-08-01)
In this study, interactive approaches for sorting alternatives evaluated on multiple criteria are developed. The possible category ranges of alternatives are defined by mathematical models iteratively under the assumption that the preferences of the decision maker (DM) are consistent with an additive utility function. Simulation-based and model-based parameter generation methods are proposed to hypothetically assign the alternatives to categories. A practical approach to solve the incompatibility problem of...
A Hierarchical representation and decoding of fMRI data by partitioning a brain network
Moğultay, Hazal; Yarman Vural, Fatoş Tunay; Department of Computer Engineering (2017)
In this study, we propose a hierarchical network representation of human brain extracted from fMRI data. This representation consists of two levels. In the first level, we form a network among the voxels, smallest building block of fMRI data. In the second level, we define a set of supervoxels by partitioning the first level network into a set of subgraphs, which are assu med to represent homogeneous brain regions with respect to a predefined criteria. For this purpose, we develop a novel brain parcellation...
Citation Formats
A. Özarslan and G. Karakaya, “An interactive sorting approach based on information theoretic measure,” presented at the 25th International Conference on Multiple Criteria Decision Making (16 - 21 Haziran 2019), İstanbul, Türkiye, 2019, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/78190.