Linear classifiers and selection of informative features


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

In this work, to construct classifiers for two linearly inseparable sets, the problem of minimizing the margin of incorrect classification is formulated, approaches to achieving approximate solution, and calculation estimates of the optimal value for this problem, are considered. Results of computational experiments that compare proposed approaches with SVM are presented. The problem of identifying informative features for large-dimensional diagnostic applications is analyzed and algorithms for its solution are developed.

About the authors

Yu. I. Zhuravlev

Dorodnicyn Computing Centre of the Russian Academy of Sciences

Email: vngrccas@mail.ru
Russian Federation, Moscow, 119333

Yu. P. Laptin

Glushkov Institute of Cybernetics of the Ukrainian National Academy of Sciences

Email: vngrccas@mail.ru
Ukraine, Kiev, 03680

A. P. Vinogradov

Dorodnicyn Computing Centre of the Russian Academy of Sciences

Author for correspondence.
Email: vngrccas@mail.ru
Russian Federation, Moscow, 119333

N. G. Zhurbenko

Glushkov Institute of Cybernetics of the Ukrainian National Academy of Sciences

Email: vngrccas@mail.ru
Ukraine, Kiev, 03680

O. P. Lykhovyd

Glushkov Institute of Cybernetics of the Ukrainian National Academy of Sciences

Email: vngrccas@mail.ru
Ukraine, Kiev, 03680

O. A. Berezovskyi

Glushkov Institute of Cybernetics of the Ukrainian National Academy of Sciences

Email: vngrccas@mail.ru
Ukraine, Kiev, 03680

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.