A Survey on Sparse Learning Models for Feature Selection
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Feature selection is important in both machine learning and pattern recognition. Successfully selecting informative features can significantly increase learning accuracy and improve result comprehensibility. Various methods have been proposed to identify informative features from high-dimensional data by removing redundant and irrelevant features to improve classification accuracy. In this article, we systematically survey existing sparse learning models for feature selection from the perspectives of individual sparse feature selection and group sparse feature selection, and analyze the differences and connections among various sparse learning models. Promising research directions and topics on sparse learning models are analyzed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
McCullagh, P., & Nelder, J. A. (1989) · doi:10.1007/978-1-4899-3242-6 · Cited by 16,836
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 3×
“Although some adaptive spare learning models (e.g., adaptive Lasso [29], adaptive elastic net [74], and adaptive sparse group Lasso [115]) have been proposed for some scenarios, it is desirable to weight different coefficients to try to reduce irrelevant features for new applications, that is, how…”
BackgroundMethodModel Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521 · cited 3×
“Zhao and Yu [22] and Meinshausen and Buhlmann [23] analyzed the variable (feature) selection consistency of Lasso when p and n tend to positive infinity.”
BackgroundMethodFeature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627 · cited 1×
“Yuan and Lin [32] proved that the adaptive Lasso obtains consistent solutions and revealed that the solution path of adaptive Lasso is piecewise linear which can be computed efficiently.”
BackgroundSimon, N., Friedman, J., Hastie, T., & Tibshirani, R. (2013) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2012.681250 · Cited by 1,380 · cited 1×
“7) Sparse Group Lasso: Simon et al. [113] proposed the sparse group Lasso model to achieve bilevel selection with penalty term (cid:2) √ The penalty term is a convex combination of the Lasso (when α = 1) and group Lasso penalties (when α = 0).”
BackgroundA survey on filter techniques for feature selection in gene expression microarray analysis
Lazar, C., Taminau, J., Meganck, S., Steenhoff, D., Coletta, A., Molter, C., de Schaetzen, V., Duque, R., Bersini, H., & Nowe, A. (2012) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2012.33 · Cited by 619 · cited 1×
“The evaluation criteria of Filter methods [6]–[8] rely only on the information attached to features and are independent of specific classifiers.”
Method
Metadata
- Authors
- Li, X., Wang, Y., & Ruiz, R.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2022-03
- Volume
- 52
- Issue
- 3
- Pages
- 1642-1660
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W3023050749
- Cited by
- 171
- References
- 10
- FWCI
- 13.30
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Survey on Sparse Learning Models for Feature Selection. https://app.cochat.ai/papers/10.1109/tcyb.2020.2982445
- The paper
- Li, X., Wang, Y., & Ruiz, R. (2022). A Survey on Sparse Learning Models for Feature Selection. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2020.2982445
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.