Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Selection of Subsets of Ordered Features in Machine Learning
| |
|
Selection of Subsets of Ordered Features in Machine Learning
O. Seredin20 , A. Kopylov20 and V. Mottl21 
| (20) |
Tula State University, 300600, Tula, pr. Lenina, 92, Russia |
| (21) |
Computing Centre of the Russian Academy of Science, 117967 Moscow, Vavilova str., 40, Russia |
Abstract
The new approach of relevant feature selection in machine learning is proposed for the case of ordered features. Feature selection
and regularization of decision rule are combined in a single procedure. The selection of features is realized by introducing
weight coefficients, characterizing degree of relevance of respective feature. A priori information about feature ordering is taken into account in the form of quadratic penalty or in the form of absolute value
penalty on the difference of weight coefficients of neighboring features. Study of a penalty function in the form of absolute
value shows computational complexity of such formulation. The effective method of solution is proposed. The brief survey of
author’s early papers, the mathematical frameworks, and experimental results are provided.
Keywords machine learning - feature selection - ordered features - regularization of training - support vector machines - parametric dynamic programming
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|