The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Selection of relevant features and examples in machine learning
Open accessOverview
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
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
WIDROW, B., & HOFF, M. E. (1960) · doi:10.21236/ad0241531 · Cited by 4,009
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Boosting a Weak Learning Algorithm by Majority
Freund, Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1136 · Cited by 1,674
Self-improving reactive agents based on reinforcement learning, planning and teaching
Lin, L.-J. (1992) · Machine Learning · doi:10.1007/bf00992699 · Cited by 1,564
Research works printed but not linked: 31
- Angluin, 1987, Learning regular sets from queries and counterexamples, Inform. and Comput., 75, 87, 10.1016/0890-5401(87)90052-6 · DOI · Paper page
- Angluin, 1993, Learning read-once formulas with queries, J. ACM, 40, 185, 10.1145/138027.138061 · DOI
- Baluja, 1997, Dynamic relevance: vision-based focus of attention using artificial neural networks (Technical Note), Artificial Intelligence, 97, 381, 10.1016/S0004-3702(97)00065-9 · DOI
- Blum, 1992, Learning Boolean functions in an infinite attribute space, Machine Learning, 9, 373, 10.1007/BF00994112 · DOI
- Blum, 1995, Learning in the presence of finitely or infinitely many irrelevant attributes, J. Comput. System Sci., 50, 32, 10.1006/jcss.1995.1004 · DOI
- Blumer, 1987, Occam's razor, Inform. Process. Lett., 24, 377, 10.1016/0020-0190(87)90114-1 · DOI · Paper page
- Blumer, 1989, Learnability and the Vapnik-Chervonenkis dimension, J. ACM, 36, 929, 10.1145/76359.76371 · DOI · Paper page
- Clark, 1989, The CN2 induction algorithm, Machine Learning, 3, 261, 10.1007/BF00116835 · DOI · Paper page
- Cohn, 1996, Active learning with statistical models, J. Artif. Intell. Research, 4, 129, 10.1613/jair.295 · DOI · Paper page
- Comon, 1994, Independent component analysis: a new concept, Signal Process., 36, 287, 10.1016/0165-1684(94)90029-9 · DOI · Paper page
- Cover, 1967, Nearest neighbor pattern classification, IEEE Trans. Inform. Theory, 13, 21, 10.1109/TIT.1967.1053964 · DOI · Paper page
- Daelemans, 1994, The acquisition of stress: a data-oriented approach, Comput. Linguistics, 20, 421
- Drucker, 1992, Improving performance in neural networks using a boosting algorithm, Vol. 4
- Greiner, 1997, Knowing what doesn't matter: exploiting the omission of irrelevant data, Artificial Intelligence, 97, 345, 10.1016/S0004-3702(97)00048-9 · DOI
- Holte, 1993, Very simple classification rules perform well on most commonly used domains, Machine Learning, 11, 63, 10.1023/A:1022631118932 · DOI · Paper page
- Johnson, 1974, Approximation algorithms for combinatorial problems, J. Comput. System Sci., 9, 256, 10.1016/S0022-0000(74)80044-9 · DOI · Paper page
- Kivinen, 1997, The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (Technical Note), Artificial Intelligence, 97, 325, 10.1016/S0004-3702(97)00039-8 · DOI
- Kohavi, 1997, Wrappers for feature subset selection, Artificial Intelligence, 97, 273, 10.1016/S0004-3702(97)00043-X · DOI · Paper page
- Knobe, 1977, A method for inferring context-free grammars, Inform. and Control, 31, 129, 10.1016/S0019-9958(76)80003-4 · DOI
- Langley, 1997, Scaling to domains with many irrelevant features, Vol. 4
- Littlestone, 1988, Learning quickly when irrelevant attributes abound: a new linear threshold algorithm, Machine Learning, 2, 285, 10.1007/BF00116827 · DOI · Paper page
- Littlestone, 1997, An apobayesian relative of winnow, Vol. 9
- Littlestone, 1994, The weighted majority algorithm, Inform. and Comput., 108, 212, 10.1006/inco.1994.1009 · DOI · Paper page
- Michalski, 1980, Pattern recognition as rule-guided inductive inference, IEEE Trans. Pattern Anal. Machine Intell., 2, 349, 10.1109/TPAMI.1980.4767034 · DOI
- Mitchell, 1982, Generalization as search, Artificial Intelligence, 18, 203, 10.1016/0004-3702(82)90040-6 · DOI · Paper page
- Pazzani, 1992, A framework for the average case analysis of conjunctive learning algorithms, Machine Learning, 9, 349, 10.1007/BF00994111 · DOI
- Pagallo, 1990, Boolean feature discovery in empirical learning, Machine Learning, 5, 71, 10.1023/A:1022611825350 · DOI · Paper page
- Rivest, 1993, Inference of finite automata using homing sequences, Inform. and Comput., 103, 299, 10.1006/inco.1993.1021 · DOI
- Rumelhart, 1986, Learning internal representations by error propagation, Vol. 1
- Sammut, 1986, Learning concepts by asking questions, Vol. 2
- Sinclair, 1989, Approximate counting, uniform generation and rapidly mixing Markov chains, Inform. and Comput., 82, 93, 10.1016/0890-5401(89)90067-9 · DOI · Paper page
Cited by
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 survey on feature selection methods
Chandrashekar, G., & Sahin, F. (2014) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2013.11.024 · Cited by 5,189
Feature selection, L 1 vs. L 2 regularization, and rotational invariance
Ng, A. Y. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015435 · Cited by 1,572
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
Single subject prediction of brain disorders in neuroimaging: Promises and pitfalls
Arbabshirani, M. R., Plis, S., Sui, J., & Calhoun, V. D. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.02.079 · Cited by 912
Metadata
- Authors
- Blum, A. L., & Langley, P.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1997-12
- Volume
- 97
- Issue
- 1-2
- Pages
- 245-271
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2040884411
- Cited by
- 3,298
- References
- 5
- FWCI
- 24.73
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/open-access/userlicense/1.0/ (vor, 5715 d)
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.
