RUS  ENG
Full version
JOURNALS // Matematicheskaya Biologiya i Bioinformatika // Archive

Mat. Biolog. Bioinform., 2015 Volume 10, Issue 2, Pages 356–371 (Mi mbb231)

Data mining

Computational complexity of prototype and feature selection for isotonic classification problems

A. V. Zukhba

Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow Region, Russia

Abstract: Decision rules with monotonicity constraints are often used in biomedical diagnostics. Simultaneous feature selection and prototype selection can significantly affect the degree of monotonicity of the data set and, as a consequence, the classification quality. In this paper we propose a systematization of discrete optimization problems of simultaneous feature selection and prototype selection and estimate their computational complexity.

Key words: machine learning, feature selection, prototype selection, isotonic classifier, discrete optimization, computational complexity.

UDC: 519.7:004.852

Received 10.09.2015, Published 25.09.2015

DOI: 10/17537/2015.10.356



© Steklov Math. Inst. of RAS, 2024