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.
My Menu
Saved Items

Selection of Subsets of Ordered Features in Machine Learning

O. Seredin20 Contact Information, A. Kopylov20 Contact Information and V. Mottl21 Contact Information

(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


Contact Information O. Seredin
Email: oseredin@yandex.ru

Contact Information A. Kopylov
Email: kopylov@uic.tula.ru

Contact Information V. Mottl
Email: vmottl@yandex.ru
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.113 • Server: mpweb22
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)