Proceedings

Joint Feature Selection and Subspace Learning

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1294-1298.

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

Abstract

Dimensionality reduction is a very important topic in machine learning. It can be generally classified into two categories: feature selection and subspace learning. In the past decades, many methods have been proposed for dimensionality reduction. However, most of these works study feature selection and subspace learning independently. In this paper, we present a framework for joint feature selection and subspace learning. We reformulate the subspace learning problem and use L2,1-norm on the projection matrix to achieve row-sparsity, which leads to selecting relevant features and learning transformation simultaneously. We discuss two situations of the proposed framework, and present their optimization algorithms. Experiments on benchmark face recognition data sets illustrate that the proposed framework outperforms the state of the art methods overwhelmingly.

Quanquan Gu, Zhenhui Li, and Jiawei Han. 2011. Joint Feature Selection and Subspace Learning. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 1294–1298. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-219
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards