A Learning Machine: Part II
The DOI matches its Crossref record.
Abstract
An effort is made to improve the performance of the learning machine described in Part I, and the over-all effect of various changes is considered. Comparative runs by machines without the scoring mechanism indicate that the grading of individual instructions can aid in the learning process. A related study is made in which automatic debugging of programs is taken as a special case of machine search. The ability to partition problems and to deal with parts in order of difficulty proves helpful.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
Some Philosophical Problems from the Standpoint of Artificial Intelligence
McCarthy, J., & Hayes, P. J. (1981) · Readings in Artificial Intelligence · doi:10.1016/b978-0-934613-03-3.50033-7 · Cited by 3,279
Steps toward Artificial Intelligence
Minsky, M. (1961) · Proceedings of the IRE · doi:10.1109/jrproc.1961.287775 · Cited by 1,675
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536
Computational Intelligence: An Introduction
Fulcher, J. (2008) · Studies in Computational Intelligence · doi:10.1007/978-3-540-78293-3_1 · Cited by 629
A comparison of linear genetic programming and neural networks in medical data mining
Brameier, M., & Banzhaf, W. (2001) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.910462 · Cited by 505
An Overview of Machine Learning
Carbonell, J. G., Michalski, R. S., & Mitchell, T. M. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_1 · Cited by 381
Quantum-inspired evolutionary algorithms: a survey and empirical study
Zhang, G. (2011) · Journal of Heuristics · doi:10.1007/s10732-010-9136-0 · Cited by 295
AN OVERVIEW OF MACHINE LEARNING
Carbonell, J. G., Michalski, R. S., & Mitchell, T. M. (1983) · Machine Learning · doi:10.1016/b978-0-08-051054-5.50005-4 · Cited by 259
Open issues in genetic programming
O’Neill, M., Vanneschi, L., Gustafson, S., & Banzhaf, W. (2010) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-010-9113-2 · Cited by 224
Generality in artificial intelligence
McCarthy, J. (2007) · ACM Turing award lectures · doi:10.1145/1283920.1283926 · Cited by 107
Metadata
- Authors
- Friedberg, R. M., Dunham, B., & North, J. H.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1959-07
- Volume
- 3
- Issue
- 3
- Pages
- 282-287
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W4234872648
- Cited by
- 140
- References
- 0
- FWCI
- 6.01
- Type
- journal article
- 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.