Adaptive Feature Selection via Boosting-Like Sparsity Regularization
暂无分享,去创建一个
Tieniu Tan | Zhenan Sun | Libin Wang | T. Tan | Zhenan Sun | Libin Wang
[1] Matthijs C. Dorst. Distinctive Image Features from Scale-Invariant Keypoints , 2011 .
[2] Corinna Cortes,et al. Support-Vector Networks , 1995, Machine Learning.
[3] Tieniu Tan,et al. l2, 1 Regularized correntropy for robust feature selection , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[4] Francesca Odone,et al. A Regularized Framework for Feature Selection in Face Detection and Authentication , 2009, International Journal of Computer Vision.
[5] Tieniu Tan,et al. Boosting ordinal features for accurate and fast iris recognition , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.
[6] Feiping Nie,et al. Efficient and Robust Feature Selection via Joint ℓ2, 1-Norms Minimization , 2010, NIPS.
[7] Paul A. Viola,et al. Detecting Pedestrians Using Patterns of Motion and Appearance , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.
[8] Tieniu Tan,et al. Ordinal Measures for Iris Recognition , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[9] Y. Freund,et al. Discussion of the Paper \additive Logistic Regression: a Statistical View of Boosting" By , 2000 .
[10] Lei Wang,et al. Exploring regularized feature selection for person specific face verification , 2011, 2011 International Conference on Computer Vision.
[11] Chih-Jen Lin,et al. LIBSVM: A library for support vector machines , 2011, TIST.
[12] Tieniu Tan,et al. Robust regularized feature selection for iris recognition via linear programming , 2012, Proceedings of the 21st International Conference on Pattern Recognition (ICPR2012).
[13] Rama Chellappa,et al. Secure and Robust Iris Recognition Using Random Projections and Sparse Representations , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.