Iterative reweighted noninteger norm regularizing SVM for gene expression data classification
From MaRDI portal
Publication:2262318
DOI10.1155/2013/768404zbMath1307.92020OpenAlexW2103533122WikidataQ30663772 ScholiaQ30663772MaRDI QIDQ2262318
Xiong-Lin Luo, Shuang Cheng Li, Jian-wei Liu
Publication date: 16 March 2015
Published in: Computational \& Mathematical Methods in Medicine (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/768404
Classification and discrimination; cluster analysis (statistical aspects) (62H30) General biostatistics (92B15) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Cites Work
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Asymptotics for Lasso-type estimators.
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Restricted isometry properties and nonconvex compressive sensing
- Just relax: convex programming methods for identifying sparse signals in noise
- Atomic Decomposition by Basis Pursuit
- Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
This page was built for publication: Iterative reweighted noninteger norm regularizing SVM for gene expression data classification