Interactive evolutionary approaches to multiobjective feature selection

Download

index.pdf

Date

2018-05-01

Author

ÖZMEN, müberra
Karakaya, Gülşah
KÖKSALAN, MUSTAFA MURAT

Metadata

Show full item record

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

Item Usage Stats

231
views

0
downloads

In feature selection problems, the aim is to select a subset of features to characterize an output of interest. In characterizing an output, we may want to consider multiple objectives such as maximizing classification performance, minimizing number of selected features or cost, etc. We develop a preference-based approach for multiobjective feature selection problems. Finding all Pareto-optimal subsets may turn out to be a computationally demanding problem and we still would need to select a solution. Therefore, we develop interactive evolutionary approaches that aim to converge to a subset that is highly preferred by the decision maker (DM). We test our approaches on several instances simulating DM preferences by underlying preference functions and demonstrate that they work well.

Subject Keywords

Management of Technology and Innovation, Management Science and Operations Research, Strategy and Management, Business and International Management, Computer Science Applications

URI

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

Journal

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH

DOI

https://doi.org/10.1111/itor.12428

Collections

Department of Business Administration, Article

Suggestions

OpenMETU
Core

Interactive evolutionary approaches to multi-objective feature selection Özmen, Müberra; Köksalan, Murat; Karakaya, Gülşah; Department of Industrial Engineering (2016) In feature selection problems, the aim is to select a subset of features to characterize an output of interest. In characterizing an output, we may want to consider multiple objectives such as maximizing classification performance, minimizing number of selected features or cost, etc. We develop a preference-based approach for multi-objective feature selection problems. Finding all Pareto optimal subsets may turn out to be a computationally demanding problem and we still would need to select a solution event...
Interactive approaches for biobjective problems with progressively changing solution sets Karakaya, Gülşah (Wiley, 2021-01-01) In this study, we develop interactive approaches to find a satisfactory alternative of a decision maker (DM) having a quasiconvex preference function where the alternative set changes progressively. In this environment, we keep searching the available set of alternatives and estimating the preference function of the DM. As new alternatives emerge, we make better use of the available preference information and eventually converge to a preferred alternative of the DM. We test our approaches on biobjective, mu...
An interactive algorithm for multiobjective ranking for underlying linear and quasiconcave value functions TEZCANER ÖZTÜRK, DİCLEHAN; Köksalan, Mustafa Murat (Wiley, 2019-07-29) We develop interactive algorithms to find a strict total order for a set of discrete alternatives for two different value functions: linear and quasiconcave. The algorithms first construct a preference matrix and then find a strict total order. Based on the ordering, they select a meaningful pair of alternatives to present the decision maker (DM) for comparison. We employ methods to find all implied preferences of the DM, after he or she makes a preference. Considering all the preferences of the DM, the pre...
Interactive algorithms for a broad underlying family of preference functions Karakaya, Gülşah; AHİPAŞAOĞLU, Selin Damla (Elsevier BV, 2018-02-16) In multi-criteria decision making approaches it is typical to consider an underlying preference function that is assumed to represent the decision maker's preferences. In this paper we introduce a broad family of preference functions that can represent a wide variety of preference structures. We develop the necessary theory and interactive algorithms for both the general family of the preference functions and for its special cases. The algorithms guarantee to find the most preferred solution (point) of the ...
An interactive approach for multiobjective decision making Koksalan, M; Karasakal, Esra (Informa UK Limited, 2006-05-01) We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an inte...

Citation Formats

m. ÖZMEN, G. Karakaya, and M. M. KÖKSALAN, “Interactive evolutionary approaches to multiobjective feature selection,” INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, pp. 1027–1052, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37819.