loading...
Joint Feature-Basis Subset Selection
Washington, D.C., USA June 27-July 02
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.1382004 IEEE Computer Society Conference ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Shai Avidan, Mitsubishi Electric Research Labs
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-hard 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.
Citation:
Shai Avidan, "Joint Feature-Basis Subset Selection," cvpr, vol. 1, pp.283-290, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions