Joint Feature-Basis Subset Selection
Abstract
We treat feature selection and basis selection in a unified framework by introducing the masking matrix. If one considers feature selection as finding a binary mask vector that determines which features participate in the learning process, and similarly, basis selection as finding a binary mask vector that determines which basis vectors are needed for the learning process, then the masking matrix is, in particular, the outer product of the feature masking vector and the basis masking vector. This representation allows for a joint estimation of both features and basis. In addition, it allows one to select features that appear in only part of the basis functions. This joint selection of feature/basis subset is not possible when using feature selection and basis selection algorithms independently, thus, the masking matrix help extend feature and basis selection methods while blurring the lines between them. The problem of searching for an optimal masking matrix is NP-hand and we offer a sub-optimal probabilistic method to find it. In particular we demonstrate our ideas on the problem of feature and basis selection for SVM classification and show results for the problem of image classification on faces and vehicles.
Cite
Text
Avidan. "Joint Feature-Basis Subset Selection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004. doi:10.1109/CVPR.2004.138Markdown
[Avidan. "Joint Feature-Basis Subset Selection." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2004.](https://mlanthology.org/cvpr/2004/avidan2004cvpr-joint/) doi:10.1109/CVPR.2004.138BibTeX
@inproceedings{avidan2004cvpr-joint,
title = {{Joint Feature-Basis Subset Selection}},
author = {Avidan, Shai},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {2004},
pages = {283-290},
doi = {10.1109/CVPR.2004.138},
url = {https://mlanthology.org/cvpr/2004/avidan2004cvpr-joint/}
}