The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Efficient feature selection filters for high-dimensional data
Open accessAbstract
Feature selection is a central problem in machine learning and pattern recognition. On large datasets (in terms of dimension and/or number of instances), using search-based or wrapper techniques can be computationally prohibitive. Moreover, many filter methods based on relevance/redundancy assessment also take a prohibitively long time on high-dimensional datasets. In this paper, we propose efficient unsupervised and supervised feature selection/ranking filters for high-dimensional datasets. These methods use low-complexity relevance and redundancy criteria, applicable to supervised, semi-supervised, and unsupervised learning, being able to act as pre-processors for computationally intensive methods to focus their attention on smaller subsets of promising features. The experimental results, with up to 10 5 features, show the time efficiency of our methods, with lower generalization error than state-of-the-art techniques, while being dramatically simpler and faster.
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.
Integrity signals
Registry
Cites
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.
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
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Gene selection for cancer classification using support vector machines
Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002) · Machine Learning · doi:10.1023/a:1012487302797 · Cited by 9,954
A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings
Friedman, M. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731944 · Cited by 2,785
Cited by
Supervised, Unsupervised, and Semi-Supervised Feature Selection: A Review on Gene Selection
Ang, J. C., Mirzal, A., Haron, H., & Hamed, H. N. A. (2016) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2015.2478454 · Cited by 641
Ucar, A., Karakose, M., & Kırımça, N. (2024) · Applied Sciences · doi:10.3390/app14020898 · Cited by 444
Metadata
- Authors
- Ferreira, A. J., & Figueiredo, M. A. T.
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2012-10
- Volume
- 33
- Issue
- 13
- Pages
- 1794-1804
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W1980688822
- Cited by
- 225
- References
- 4
- FWCI
- 8.69
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Efficient feature selection filters for high-dimensional data. https://app.cochat.ai/papers/10.1016/j.patrec.2012.05.019
- The paper
- Ferreira, A. J., & Figueiredo, M. A. T. (2012). Efficient feature selection filters for high-dimensional data. Pattern Recognition Letters. https://doi.org/10.1016/j.patrec.2012.05.019
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.