Transactions on Machine Learning and Data Mining (ISSN: 1865-6781)


Volume 2 - Number 2 - October 2009 - Page 65-79


Selection of Subsets of Ordered Features in Machine Learning

O. Seredin1, A. Kopylov1, V. Mottl2

1 Tula State University, 300600, Tula, pr. Lenina, 92, Russia
2 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.


PDFDownload Paper (183 KB)


Back to Table of Contents