Author:
Fung G. M.,Mangasarian O. L.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference12 articles.
1. Candès, E., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted ℓ 1 minimization. J. Fourier Anal. Appl. 14, 877–905 (2008)
2. Candés, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51, 4203–4215 (2005)
3. Donoho, D.L.: For most large underdetermined systems of linear equations the minimal ℓ 1-norm solution is also the sparsest solution. Commun. Pure Appl. Math. 59, 797–829 (2006). http://www-stat.stanford.edu/donoho/Reports/2004/l1l0EquivCorrected.pdf
4. Bradley, P.S., Mangasarian, O.L.: Feature selection via concave minimization and support vector machines. In: Shavlik, J. (ed.) Proceedings 15th International Conference on Machine Learning, San Francisco, California, pp. 82–90. Morgan Kaufmann, San Mateo (1998). ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98-03.ps
5. Mangasarian, O.L.: Machine learning via polyhedral concave minimization. In: Fischer, H., Riedmueller, B., Schaeffler, S. (eds.) Applied Mathematics and Parallel Computing—Festschrift for Klaus Ritter, pp. 175–188. Physica-Verlag, Springer, Heidelberg (1996). ftp://ftp.cs.wisc.edu/math-prog/tech-reports/95-20.ps
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献