Graph Laplacian for Semi-supervised Feature Selection in Regression Problems
(2011) 11th international work-conference on artificial neural networks (IWANN 2011) — Location: Torremolinos (Spain) (8.June.2011)
Files
iwann11gd.pdf
Restricted Access - Adobe PDF
- 179.08 KB
Details
- Authors
- Abstract
- Feature selection is fundamental in many data mining or machine learning applications. Most of the algorithms proposed for this task make the assumption that the data are either supervised or unsupervised, while in practice supervised and unsupervised samples are often simultaneously available. Semi-supervised feature selection is thus needed, and has been studied quite intensively these past few years almost exclusively for classification problems. In this paper, a supervised then a semi-supervised feature selection algorithms specially designed for regression problems are presented. Both are based on the Laplacian Score, a quantity recently introduced in the unsupervised framework. Experimental evidences show the efficiency of the two algorithms.
- Affiliations
Citations
Doquire, G., & Verleysen, M. (2011). Graph Laplacian for Semi-supervised Feature Selection in Regression Problems. In Joan Cabestany (ed.), Advances in Computational Intelligence (p. p. 248-255). Springer. https://doi.org/10.1007/978-3-642-21501-8_31