The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
High-performing feature selection for text classification
Abstract
This paper reports a controlled study on a large number of filter feature selection methods for text classification. Over 100 variants of five major feature selection criteria were examined using four well-known classification algorithms: a Naive Bayesian (NB) approach, a Rocchio-style classifier, a k-nearest neighbor (kNN) method and a Support Vector Machine (SVM) system. Two benchmark collections were chosen as the testbeds: Reuters-21578 and small portion of Reuters Corpus Version 1 (RCV1), making the new results comparable to published results. We found that feature selection methods based on chi2 statistics consistently outperformed those based on other criteria (including information gain) for all four classifiers and both data collections, and that a further increase in performance was obtained by combining uncorrelated and high-performing feature selection methods.The results we obtained using only 3% of the available features are among the best reported, including results obtained with the full feature set.
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
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Self-citationIrrelevant Features and the Subset Selection Problem
John, G. H., Kohavi, R., & Pfleger, K. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50023-4 · Cited by 2,368
Making Large-Scale Support Vector Machine Learning Practical
Joachims, T. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0015 · Cited by 1,613
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Distributional clustering of words for text classification
Baker, L. D., & McCallum, A. K. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290970 · Cited by 676
Feature selection for high-dimensional genomic microarray data
Xing, E. P., Jordan, M. I., & Karp, R. M. (2001) · Cited by 635
Cited by
RCV1: A New Benchmark Collection for Text Categorization Research
Lewis, D., Yang, Y., Rose, T. G., & Li, F. (2004) · Goldsmiths (University of London) · doi:10.5555/1005332.1005345 · Cited by 2,503
Self-citationRandom k-Labelsets for Multilabel Classification
Tsoumakas, G., Katakis, I., & Vlahavas, I. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.164 · Cited by 895
Random k-Labelsets: An Ensemble Method for Multilabel Classification
Tsoumakas, G., & Vlahavas, I. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74958-5_38 · Cited by 871
A Review of Machine Learning Algorithms for Text-Documents Classification
Baharudin, B., Lee, L. H., & Khan, K. (2010) · Journal of Advances in Information Technology · doi:10.4304/jait.1.1.4-20 · Cited by 653
Common Sense Reasoning for Detection, Prevention, and Mitigation of Cyberbullying
Dinakar, K., Jones, B., Havasi, C., Lieberman, H., & Picard, R. (2012) · ACM Transactions on Interactive Intelligent Systems · doi:10.1145/2362394.2362400 · Cited by 432
Metadata
- Authors
- Rogati, M., & Yang, Y.
- Venue
- Proceedings of the eleventh international conference on Information and knowledge management
- Publisher
- ACM
- Published
- 2002-11-04
- Pages
- 659-661
- OpenAlex
- W2040241219
- Cited by
- 303
- References
- 6
- FWCI
- 5.71
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: High-performing feature selection for text classification. https://app.cochat.ai/papers/10.1145/584792.584911
- The paper
- Rogati, M., & Yang, Y. (2002). High-performing feature selection for text classification. Proceedings of the eleventh international conference on Information and knowledge management. https://doi.org/10.1145/584792.584911
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.