10,000+ times accelerated robust subset selection (ARSS)

Proceedings of the National Conference on Artificial Intelligence

Volumn 4, Issue , 2015, Pages 3217-3223

  Zhu, Feiyun ^a   Fan, Bin ^a   Zhu, Xinliang ^a   Wang, Ying ^a   Xiang, Shiming ^a   Pan, Chunhong ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STATISTICS;

BENCHMARK DATASETS; COMPUTATIONAL COSTS; DATA SIZE; MASSIVE DATA; STATE-OF-THE-ART METHODS; SUBSET SELECTION;

SET THEORY;

EID: 84960110729     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Bien, J., and Tibshirani, R. 2011. Prototype selection for interpretable classification. Annals of Applied Statistics 5(4):2403-2424.
2. Boutsidis, C; Mahoney, M. W.; and Drineas, P. 2009. An improved approximation algorithm for the column subset selection problem. In SODA, 968-977.
3. Chan, T. F. 1987. Rank revealing {QR} factorizations. Linear Algebra and its Applications 88-89(0):67-82.
4. Elhamifar, E.; Sapiro, G.; Vidal, R.; and Vidal, R. 2012a. See all by looking at a few: Sparse modeling for finding representative objects. In IEEE CVPR, 1600-1607.
5. Elhamifar, E.; Sapiro, G.; Vidal, R.; and Vidal, R. 2012b. Finding exemplars from pairwise dissimilarities via simultaneous sparse recovery. In NIPS, 19-27.
6. Frey, B. J., and Dueck, D. 2007. Clustering by passing messages between data points. Science 315(5814):972-976.
7. Garcia, S.; Derrac, J.; Cano, J. R.; and Herrera, F. 2012. Prototype selection for nearest neighbor classification: Taxonomy and empirical study. IEEE Trans. Pattern Anal. Mach. Intell. 34(3):417-435.
8. Jenalton, R.; Audibert, J.-Y.; and Bach, F. 2011. Structured variable selection with sparsity-inducing norms. Journal of Machine Learning Research (JMLR) 12:2777-2824.
9. Levin, A.; Lischinski, D.; Weiss, Y.; and Weiss, Y. 2008. A closed-form solution to natural image matting. IEEE Trans. Pattern Anal. Mach. Intell. 30(2):228-242.
10. Li, C. 2011. Compressive Sensing for 3D Data Processing Tasks: Applications, Models and Algorithms. Ph. D. Dissertation, Houston, TX, USA. AAI3524544.
11. Liu, G.; Lin, Z.; Yu, Y; and Yu, Y. 2010. Robust subspace segmentation by low-rank representation. In ICML, 663-670.
12. Meng, G.; Wang, Y; Duan, J.; Xiang, S.; and Pan, C. 2013. Efficient image dehazing with boundary constraint and contextual regularization. In ICCV, 617-624.
13. Nie, E; Wang, H.; Cai, X.; Huang, H.; and Ding, C. 2012. Robust matrix completion via joint schatten p-norm and lpnorm minimization. In IEEE ICDM, 1566-574.
14. Nie, F.; Wang, H.; Huang, H.; and Ding, C. H. Q. 2013. Early active learning via robust representation and structured sparsity. In IJCAI, 1572-1578.
15. Nie, E; Huang, Y; Wang, X.; and Huang, H. 2014. New primal svm solver with linear computational cost for big data classifications. In ICML.
16. Nocedal, J., and Wright, S. J. 2006. Numerical Optimization. New York: Springer, 2nd edition.
17. Wang, H.; Nie, F.; Huang, H.; and Huang, H. 2014. Robust distance metric learning via simultaneous 11-norm minimization and maximization. In ICML, 1836-1844.
18. Wang, J.; Kumar, S.; and Chang, S.-F. 2012. Semisupervised hashing for large-scale search. IEEE Trans. Pattern Anal. Mach. Intell. 34.
19. Wright, J.; Ganesh, A.; Rao, S.; Peng, Y; and Ma, Y 2009. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. In NIPS, 2080-2088.
20. Yu, K.; Zhu, S.; Xu, W;; and Gong, Y. 2008. Non-greedy active learning for text categorization using convex transductive experimental design. In SIGIR, 1081-1088.
21. Yu, K.; Bi, J.; and Tresp, V. 2006. Active learning via transductive experimental design. In ICML, 1081-1088.
22. Zhu, E; Wang, Y; Fan, B.; Meng, G.; and Pan, C. 2014. Effective spectral unmixing via robust representation and learning-based sparsity. arXiv: 1409.0685.
23. Zuo, W.; Meng, D.; Zhang, L.; Feng, X.; and Zhang, D. 2013. A generalized iterated shrinkage algorithm for nonconvex sparse coding. In IEEE ICCV, 217-224.