Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,157

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A survey of feature selection and feature extraction techniques in machine learning

Khalid, Samina, Khalil, Tehmina, Nasreen, Shamila·2014·2014 Science and Information Conference

Abstract

Dimensionality reduction as a preprocessing step to machine learning is effective in removing irrelevant and redundant data, increasing learning accuracy, and improving result comprehensibility. However, the recent increase of dimensionality of data poses a severe challenge to many existing feature selection and feature extraction methods with respect to efficiency and effectiveness. In the field of machine learning and pattern recognition, dimensionality reduction is important area, where many approaches have been proposed. In this paper, some widely used feature selection and feature extraction techniques have analyzed with the purpose of how effectively these techniques can be used to achieve high performance of learning algorithms that ultimately improves predictive accuracy of classifier. An endeavor to analyze dimensionality reduction techniques briefly with the purpose to investigate strengths and weaknesses of some widely used dimensionality reduction methods is presented.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/sai.2014.6918213

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

Research works printed but not linked: 28

  1. zhao, 2007, Searching for interacting features, Proceedings of International Joint Conference on Artificial Intelligence, 1156
  2. 10.1109/ICCSEE.2012.97 · DOI
  3. 10.5121/ijaia.2010.1405 · DOI
  4. 10.1109/ICDMW.2007.77 · DOI
  5. 10.1016/j.knosys.2005.11.014 · DOI
  6. 10.1162/153244303322753616 · DOI
  7. yu, 0, Feature selection for high-dimensional data: A fast correlation-based filter solution, Proceeding of the
  8. cateni, 2012, Variable selection and feature extraction through artificial intelligence techniques, Multivariate Analysis in Management Engineering and the Science Chapter 6, 103
  9. hyyarinen, 1999, Survey on independent component analysis, Neural Computing Surveys, 2, 94
  10. 10.1073/pnas.082099299 · DOI
  11. langlois, 2010, An introduction to independent component analysis: Infomax and fastica algorithms, Tutorials in Quantitative Methods for Psychology, 6, 31, 10.20982/tqmp.06.1.p031 · DOI
  12. 10.1037/1082-989X.12.3.336 · DOI · Paper page
  13. zhou, 2003, Probabilistic Analysis of Kernel Principle Components Mixture Modeling and Classification, 1
  14. 10.1109/CBMS.2006.65 · DOI
  15. 10.1142/S0219720005001004 · DOI · Paper page
  16. fleuret, 2004, Fast binary selection with conditional mutual information, Journal of Machine Learning, 1531
  17. 10.1162/153244303322753616 · DOI
  18. klassen, 2009, Nearest shrunken centroid as feature selection of microarray data, Proceedings of Computers and Their Applications, 227
  19. ladla, 2011, Feature selection methods and algorithms, International Journal on Computer Science and Engineering (IJCSE), 3, 1787
  20. motoda, 2002, Feature selection, extraction and construction, Towards the Foundation of Data Mining Workshop Sixth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2002) Taipei Taiwan, 67
  21. 10.5120/800-1137 · DOI
  22. 10.1109/MLSP.2006.275572 · DOI
  23. 10.1145/2381716.2381725 · DOI
  24. 10.1109/SSIAI.2008.4512286 · DOI
  25. 10.1016/S1088-467X(97)00008-5 · DOI
  26. janecek, 2008, On the relationship between feature selection and classification accuracy, Proceeding of New Challenges for Feature Selection, 40
  27. rajarajeswari, 2012, An empirical study of feature selection for data classification, International Journal of Advanced Computer Research, 2, 111
  28. 10.1109/ISBI.2013.6556807 · DOI

Cited by

Metadata

Authors
Khalid, S., Khalil, T., & Nasreen, S.
Venue
2014 Science and Information Conference
Publisher
IEEE
Published
2014-08
Pages
372-378
OpenAlex
W2087016914
Cited by
1,157
References
1
FWCI
6.67
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.