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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Guyon, I., Elisseeff, A.: An Introduction to Variable and Feature Selection. J. Mach. Lear. Res. 3, 1157–1182 (2003)
Battiti, R.: Using Mutual Information for Selecting Features in Supervised Neural Net Learning. IEEE T. Neural. Networ. 5, 537–550 (1994)
Mitra, P., Murthy, C.A., Pal, S.K.: Unsupervised Feature Selection Using Feature Similarity. IEEE T. Pattern. Anal. 24 (2002)
He, X., Cai, D., Niyogi, P.: Laplacian Score for Feature Selection. In: Advances in Neural Information Processing Systems (NIPS), vol. 17 (2005)
Chapelle, O., Schölkopf, B., Zien, A.: Semi-Supervised Learning. MIT Press, Cambridge (2007)
Zhu, X., Goldberg, A.B.: Introduction to Semi-Supervised Learning. Morgan & Claypool Publishers, San Francisco (2009)
Zhao, Z., Liu, H.: Semi-supervised Feature Selection via Spectral Analysis. In: 7th SIAM International Conference on Data Mining (2007)
Quinzán, I., Sotoca, J.M., Pla, F.: Clustering-Based Feature Selection in Semi-supervised Problems. In: 9th International Conference on Intelligent Systems Design and Applications, pp. 535–540 (2009)
Chung, F.R.K.: Spectral Graph Theory. CBMS Regional Conference Series in Mathematics 92. American Mathematical Society, Providence (1997)
Rossi, F., Delannay, N., Conan-Guez, B., Verleysen, M.: Representation of Functional Data in Neural Networks. Neurocomputing 64, 183–210 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doquire, G., Verleysen, M. (2011). Graph Laplacian for Semi-supervised Feature Selection in Regression Problems. In: Cabestany, J., Rojas, I., Joya, G. (eds) Advances in Computational Intelligence. IWANN 2011. Lecture Notes in Computer Science, vol 6691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21501-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-21501-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21500-1
Online ISBN: 978-3-642-21501-8
eBook Packages: Computer ScienceComputer Science (R0)