The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
A review of feature selection methods with applications
Abstract
Feature selection (FS) methods can be used in data pre-processing to achieve efficient data reduction. This is useful for finding accurate data models. Since exhaustive search for optimal feature subset is infeasible in most cases, many search strategies have been proposed in literature. The usual applications of FS are in classification, clustering, and regression tasks. This review considers most of the commonly used FS techniques. Particular emphasis is on the application aspects. In addition to standard filter, wrapper, and embedded methods, we also provide insight into FS for recent hybrid approaches and other advanced topics.
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
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Feature selection for classification
DASH, M., & LIU, H. (1997) · Intelligent Data Analysis · doi:10.1016/s1088-467x(97)00008-5 · Cited by 3,574
Theoretical and Empirical Analysis of ReliefF and RReliefF
Robnik-Šikonja, M., & Kononenko, I. (2003) · Machine Learning · doi:10.1023/a:1025667309714 · Cited by 3,025
Toward integrating feature selection algorithms for classification and clustering
Liu, H., & Yu, L. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.66 · Cited by 2,706
Variable selection using random forests
Genuer, R., Poggi, J.-M., & Tuleau-Malot, C. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.03.014 · Cited by 2,619
An extensive empirical study of feature selection metrics for text classification
Forman, G. (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944974 · Cited by 2,394
Feature selection for high-dimensional data: a fast correlation-based filter solution
Yu, L., & Liu, H. (2003) · Cited by 2,305
Feature Selection for Knowledge Discovery and Data Mining
Liu, H., & Motoda, H. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5689-3 · Cited by 2,198
Efficient Feature Selection via Analysis of Relevance and Redundancy
Yu, L., & Liu, H. (2004) · doi:10.5555/1005332.1044700 · Cited by 1,983
(2011) · Speech and Audio Signal Processing · doi:10.1002/9781118142882.ch8 · Cited by 1,084
Feature Selection via Concave Minimization and Support Vector Machines
Bradley, P. S., & Mangasarian, O. L. (1998) · Cited by 984
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
A framework for feature selection in clustering
Witten, D. M., & Tibshirani, R. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2010.tm09415 · Cited by 696 · cited 1×
“Feature selection for sparse clustering multivariate, similarity clustering [12]”
A probabilistic approach to feature selection - a filter solution
Liu, H., & Setiono, R. (1996) · Cited by 665
MIFS-ND: A mutual information-based feature selection method
Hoque, N., Bhattacharyya, D. K., & Kalita, J. K. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.04.019 · Cited by 442 · cited 1×
“Since exhaustive search for optimal feature subset is infeasible in most cases, many search strategies have been proposed in literature.”
BackgroundLearning from labeled and unlabeled data on a directed graph
Zhou, D., Huang, J., & Schölkopf, B. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102482 · Cited by 403
Discriminative Semi-Supervised Feature Selection Via Manifold Regularization
Xu, Z., King, I., Lyu, M. R.-T., & Jin, R. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2010.2047114 · Cited by 384
Feature Weighting in k-Means Clustering
Modha, D. S., & Spangler, W. S. (2003) · Machine Learning · doi:10.1023/a:1024016609528 · Cited by 382
Feature Selection for Clustering: A Review
Alelyani, S., Tang, J., & Liu, H. (2018) · Data Clustering · doi:10.1201/9781315373515-2 · Cited by 371
Feature selection for high-dimensional class-imbalanced data sets using Support Vector Machines
Maldonado, S., Weber, R., & Famili, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.07.015 · Cited by 317
Penalized feature selection and classification in bioinformatics
Ma, S., & Huang, J. (2008) · Briefings in Bioinformatics · doi:10.1093/bib/bbn027 · Cited by 259
On the "dimensionality curse" and the "self-similarity blessing"
Korn, F., Pagel, B.-U., & Faloutsos, C. (2001) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.908983 · Cited by 220
Online feature selection using grafting
Perkins, S. J., & Theiler, J. P. (2003) · Cited by 206
Sparse Multinomial Logistic Regression via Bayesian L1 Regularisation
Cawley, G. C., Talbot, N. L. C., & Girolami, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0031 · Cited by 189
Modeling disease progression via fused sparse group lasso
Zhou, J., Liu, J., Narayan, V. A., & Ye, J. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339702 · Cited by 179
Feature subset selection Filter–Wrapper based on low quality data
Figueredo, J. M. C., Garrido, M. C., & Martínez‐España, R. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.05.051 · Cited by 151
Online Streaming Feature Selection
Wu, X., Yu, K., Wang, H., & Ding, W. (2010) · Adelaide Research & Scholarship (AR&S) (University of Adelaide) · Cited by 141
Feature selection from huge feature sets
Bins, J., & Draper, B. A. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937619 · Cited by 140
Variable Selection Using Random Forests
Sandri, M. F., & Zuccolotto, P. (2007) · Springer eBooks · doi:10.1007/3-540-35978-8_30 · Cited by 138
Evolutionary model selection in unsupervised learning
Kim, Y., Street, W. N., & Menczer, F. (2002) · Intelligent Data Analysis · doi:10.3233/ida-2002-6605 · Cited by 122
Abusamra, H. (2013) · Procedia Computer Science · doi:10.1016/j.procs.2013.10.003 · Cited by 90
Feature selection for nonlinear models with extreme learning machines
Frénay, B., van Heeswijk, M., Miché, Y., Verleysen, M., & Lendasse, A. (2012) · Neurocomputing · doi:10.1016/j.neucom.2011.12.055 · Cited by 80
Global geometric similarity scheme for feature selection in fault diagnosis
Liu, C., Jiang, D., & Yang, W. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.11.037 · Cited by 58
A Comparative Analysis of Biomarker Selection Techniques
Dessì, N., Pascariello, E., & Pes, B. (2013) · BioMed Research International · doi:10.1155/2013/387673 · Cited by 45
RELIEF-C: Efficient Feature Selection for Clustering over Noisy Data
Dash, M., & Ong, Y.-S. (2011) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/ictai.2011.135 · Cited by 22
Multi Criteria Wrapper Improvements to Naive Bayes Learning
Cortizo, J. C., & Giráldez, I. (2006) · Lecture notes in computer science · doi:10.1007/11875581_51 · Cited by 13
Cited by
Relief-based feature selection: Introduction and review
Urbanowicz, R. J., Meeker, M., La Cava, W., Olson, R. S., & Moore, J. H. (2018) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2018.07.014 · Cited by 1,311
XGBoost Model for Chronic Kidney Disease Diagnosis
Ogunleye, A., & Wang, Q.-G. (2020) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2019.2911071 · Cited by 762
Benchmark for filter methods for feature selection in high-dimensional classification data
Bommert, A., Sun, X., Bischl, B., Rahnenführer, J., & Lang, M. (2020) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2019.106839 · Cited by 725
Metaheuristic Algorithms on Feature Selection: A Survey of One Decade of Research (2009-2019)
Agrawal, P., Abutarboush, H. F., Ganesh, T., & Mohamed, A. W. (2021) · IEEE Access · doi:10.1109/access.2021.3056407 · Cited by 613
Taha, A. A., & Malebary, S. J. (2020) · IEEE Access · doi:10.1109/access.2020.2971354 · Cited by 443
Metadata
- Authors
- Jovic, A., Brkic, K., & Bogunovic, N.
- Venue
- 2015 38th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
- Publisher
- IEEE
- Published
- 2015-05
- Pages
- 1200-1205
- OpenAlex
- W1487321909
- Cited by
- 1,209
- References
- 38
- FWCI
- 60.03
- Type
- conference paper
- 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
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.