References
[1]
Gu
M,
Eisenstat
S C.
Efficient algorithms for computing a strong rank-revealing QR factorization.
SIAM J Sci Comput,
1996, 17: 848-869
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Efficient algorithms for computing a strong rank-revealing QR factorization&author=Gu M&author=Eisenstat S C&publication_year=1996&journal=SIAM J Sci Comput&volume=17&pages=848-869
[2]
Zhou Z-H. Ensemble Methods: Foundations and Algorithms. Boca Raton: Chapman and Hall/CRC, 2012.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Zhou Z-H. Ensemble Methods: Foundations and Algorithms. Boca Raton: Chapman and Hall/CRC, 2012&
[3]
Xie
B,
Liu
Y,
Zhang
H, et al.
Efficient image representation for object recognition via pivots selection.
Front Comput Sci,
2015, 9: 383-391
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Efficient image representation for object recognition via pivots selection&author=Xie B&author=Liu Y&author=Zhang H&publication_year=2015&journal=Front Comput Sci&volume=9&pages=383-391
[4]
Zhang Y Q, Xiao J S, Li S H, et al. Learning block-structured incoherent dictionaries for sparse representation. Sci China Inf Sci, 2015, 58: 102302.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Zhang Y Q, Xiao J S, Li S H, et al. Learning block-structured incoherent dictionaries for sparse representation. Sci China Inf Sci, 2015, 58: 102302&
[5]
Davis
G,
Mallat
S,
Avellaneda
M.
Adaptive greedy approximations.
Constr Approx,
1997, 13: 57-98
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Adaptive greedy approximations&author=Davis G&author=Mallat S&author=Avellaneda M&publication_year=1997&journal=Constr Approx&volume=13&pages=57-98
[6]
Gilbert A C, Muthukrishnan S, Strauss M J. Approximation of functions over redundant dictionaries using coherence. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 2003. 243-252.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Gilbert A C, Muthukrishnan S, Strauss M J. Approximation of functions over redundant dictionaries using coherence. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 2003. 243-252&
[7]
Tropp
J A.
Greed is good: algorithmic results for sparse approximation.
IEEE Trans Inf Theory,
2004, 50: 2231-2242
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Greed is good: algorithmic results for sparse approximation&author=Tropp J A&publication_year=2004&journal=IEEE Trans Inf Theory&volume=50&pages=2231-2242
[8]
Tibshirani R. Regression shrinkage and selection via the lasso. J Royal Stat Soc: Ser B (Methodological), 1996, 58: 267-288.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Tibshirani R. Regression shrinkage and selection via the lasso. J Royal Stat Soc: Ser B (Methodological), 1996, 58: 267-288&
[9]
Zou
H,
Hastie
T.
Regularization and variable selection via the elastic net.
J Royal Stat Soc: Ser B (Methodological),
2005, 67: 301-320
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Regularization and variable selection via the elastic net&author=Zou H&author=Hastie T&publication_year=2005&journal=J Royal Stat Soc: Ser B (Methodological)&volume=67&pages=301-320
[10]
Yu
Y,
Yao
X,
Zhou
Z-H.
On the approximation ability of evolutionary optimization with application to minimum set cover.
Artif Intell,
2012, 180-181: 20-33
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=On the approximation ability of evolutionary optimization with application to minimum set cover&author=Yu Y&author=Yao X&author=Zhou Z-H&publication_year=2012&journal=Artif Intell&volume=180-181&pages=20-33
[11]
Qian C, Yu Y, Zhou Z-H. Pareto ensemble pruning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin, 2015. 2935-2941.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Qian C, Yu Y, Zhou Z-H. Pareto ensemble pruning. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, Austin, 2015. 2935-2941&
[12]
Qian C, Yu Y, Zhou Z-H. On constrained Boolean Pareto optimization. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, Buenos Aires, 2015. 389-395.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Qian C, Yu Y, Zhou Z-H. On constrained Boolean Pareto optimization. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence, Buenos Aires, 2015. 389-395&
[13]
Qian C, Yu Y, Zhou Z-H. Subset selection by Pareto optimization. In: Proceedings of Advances in Neural Information Processing Systems 28, Montreal, 2015. 1765-1773.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Qian C, Yu Y, Zhou Z-H. Subset selection by Pareto optimization. In: Proceedings of Advances in Neural Information Processing Systems 28, Montreal, 2015. 1765-1773&
[14]
Miller A. Subset Selection in Regression. 2nd ed. London: Chapman and Hall/CRC, 2002.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Miller A. Subset Selection in Regression. 2nd ed. London: Chapman and Hall/CRC, 2002&
[15]
Das A, Kempe D. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of the 28th International Conference on Machine Learning, Bellevue, 2011. 1057-1064.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Das A, Kempe D. Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. In: Proceedings of the 28th International Conference on Machine Learning, Bellevue, 2011. 1057-1064&
[16]
Das A, Kempe D. Algorithms for subset selection in linear regression. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 2008. 45-54.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Das A, Kempe D. Algorithms for subset selection in linear regression. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, 2008. 45-54&
[17]
Qian C, Shi J-C, Yu Y, et al. Parallel Pareto optimization for subset selection. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, New York, 2016. 1-7.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Qian C, Shi J-C, Yu Y, et al. Parallel Pareto optimization for subset selection. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence, New York, 2016. 1-7&
[18]
Natarajan
B K.
Sparse approximate solutions to linear systems.
SIAM J Sci Comput,
1995, 24: 227-234
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Sparse approximate solutions to linear systems&author=Natarajan B K&publication_year=1995&journal=SIAM J Sci Comput&volume=24&pages=227-234
[19]
Diekhoff G. Statistics for the Social and Behavioral Sciences: Univariate, Bivariate, Multivariate. New York: William C Brown Pub, 1992.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Diekhoff G. Statistics for the Social and Behavioral Sciences: Univariate, Bivariate, Multivariate. New York: William C Brown Pub, 1992&
[20]
Johnson R A, Wichern D W. Applied Multivariate Statistical Analysis. 6th ed. New York: Pearson, 2007.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Johnson R A, Wichern D W. Applied Multivariate Statistical Analysis. 6th ed. New York: Pearson, 2007&
[21]
Tropp J A, Gilbert A C, Muthukrishnan S, et al. Improved sparse approximation over quasiincoherent dictionaries. In: Proceedings of the 11th International Conference on Image Processing, Barcelona, 2003. 37-40.
Google Scholar
http://scholar.google.com/scholar_lookup?title=Tropp J A, Gilbert A C, Muthukrishnan S, et al. Improved sparse approximation over quasiincoherent dictionaries. In: Proceedings of the 11th International Conference on Image Processing, Barcelona, 2003. 37-40&
[22]
Shalev-Shwartz
S,
Srebro
N,
Zhang
T.
Trading accuracy for sparsity in optimization problems with sparsity constraints.
SIAM J Optimiz,
2010, 20: 2807-2832
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Trading accuracy for sparsity in optimization problems with sparsity constraints&author=Shalev-Shwartz S&author=Srebro N&author=Zhang T&publication_year=2010&journal=SIAM J Optimiz&volume=20&pages=2807-2832
[23]
Yuan
X-T,
Yan
S.
Forward basis selection for pursuing sparse representations over a dictionary.
IEEE Trans Pattern Anal Mach Intell,
2013, 35: 3025-3036
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=Forward basis selection for pursuing sparse representations over a dictionary&author=Yuan X-T&author=Yan S&publication_year=2013&journal=IEEE Trans Pattern Anal Mach Intell&volume=35&pages=3025-3036
[24]
Nemhauser
G L,
Wolsey
L A,
Fisher
M L.
An analysis of approximations for maximizing submodular set functions - I.
Math Prog,
1978, 14: 265-294
CrossRef
Google Scholar
http://scholar.google.com/scholar_lookup?title=An analysis of approximations for maximizing submodular set functions - I&author=Nemhauser G L&author=Wolsey L A&author=Fisher M L&publication_year=1978&journal=Math Prog&volume=14&pages=265-294