Proceedings

Feature Selection via Joint Embedding Learning and Sparse Regression

Chenping Hou, Feiping Nie, Dongyun Yi, Yi Wu

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1324-1328.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-224

Abstract

The problem of feature selection has aroused considerable research interests in the past few years. Traditional learning based feature selection methods separate embedding learning and feature ranking. In this paper, we introduce a novel unsupervised feature selection approach via Joint Embedding Learning and Sparse Regression (JELSR). Instead of simply employing the graph laplacian for embedding learning and then regression, we use the weight via locally linear approximation to construct graph and unify embedding learning and sparse regression to perform feature selection. By adding the l2,1-norm regularization, we can learn a sparse matrix for feature ranking. We also provide an effective method to solve the proposed problem. Compared with traditional unsupervised feature selection methods, our approach could integrate the merits of embedding learning and sparse regression simultaneously. Plenty of experimental results are provided to show the validity.

Chenping Hou, Feiping Nie, Dongyun Yi, and Yi Wu. 2011. Feature Selection via Joint Embedding Learning and Sparse Regression. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1324–1328. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-224
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards