The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A Practical Approach to Feature Selection
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
Instance-based learning algorithms
Aha, D. W., Kibler, D., & Albert, M. K. (1991) · Machine Learning · doi:10.1007/bf00153759 · Cited by 2,163
The feature selection problem: traditional methods and a new algorithm
Kira, K., & Rendell, L. A. (1992) · National Conference on Artificial Intelligence · Cited by 1,897
Self-citationLearning Efficient Classification Procedures and Their Application to Chess End Games
Quinlan, J. R. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_15 · Cited by 1,178
Incremental learning from noisy data
Schlimmer, J. C., & Granger, R. H. (1986) · Machine Learning · doi:10.1007/bf00116895 · Cited by 653
Learning with many irrelevant features
Almuallim, H., & Dietterich, T. G. (1991) · Cited by 623
Concept learning and heuristic classification in weak-theory domains
Porter, B. W., Bareiss, R., & Holte, R. C. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90041-w · Cited by 250
Constructive induction on decision trees
Matheus, C. J., & Rendell, L. A. (1989) · Cited by 189
Self-citationBareiss, R. (1990) · CERN Document Server (European Organization for Nuclear Research) · Cited by 179
Research works printed but not linked: 7
- Aha, D. W. Incremental Instance-Based Learning of Independent and Graded Concept Descriptions, Proceedings of the Sixth International Workshop on Machine Learning. · doi:10.1016/b978-1-55860-036-2.50098-9
- Aha, D. W. & McNulty, D. M. Learning Relative Attribute Weights for Instance-Based Concept Descriptions, Proceedings of the Eleventh Annual Conference of the Cognitive Science Society.
- Callan, J. P., Fawcett, T. E. & Rissland, E. L., CABOT : An Adaptive Approach to Case-Based Search, Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 1991, 803–808.
- Pagallo, G., Learning DNF by Decision Trees, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 1989, 639–644.
- Rendell, 1989, Improving the Design of Similarity-Based Rule-Learning Systems, International Journal of Expert Systems, 2, 97
- Schlimmer, J. C., Learning and Representation Change, Proceedings of the Fifth National Conference on Artificial Intelligence
- Yang, D-S., Blix, G. & Rendell, L. A. The Replication Problem: A Constructive Induction Approach, Proceedings of European Working Session on Learning, march, 1991. · doi:10.1007/bfb0017003
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Wrappers for feature subset selection
Kohavi, R., & John, G. H. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00043-x · Cited by 8,947
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303322753616 · Cited by 3,502
(1998) · Cited by 3,476
Selection of relevant features and examples in machine learning
Blum, A. L., & Langley, P. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00063-5 · Cited by 3,298
Metadata
- Authors
- Kira, K., & Rendell, L. A.
- Venue
- Machine Learning Proceedings 1992
- Publisher
- Elsevier
- Published
- 1992
- Pages
- 249-256
- OpenAlex
- W1583700199
- Cited by
- 2,978
- References
- 12
- FWCI
- 17.13
- Type
- book chapter
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
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 Practical Approach to Feature Selection. https://app.cochat.ai/papers/10.1016/b978-1-55860-247-2.50037-1
- The paper
- Kira, K., & Rendell, L. A. (1992). A Practical Approach to Feature Selection. Machine Learning Proceedings 1992. https://doi.org/10.1016/b978-1-55860-247-2.50037-1
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.