The Lack of A Priori Distinctions Between Learning Algorithms
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
Citation edge evidence
- No free lunch theorems for optimization→The Lack of A Priori Distinctions Between Learning AlgorithmsLegacy edge — source detail unavailable
- A few useful things to know about machine learning→The Lack of A Priori Distinctions Between Learning AlgorithmsLegacy edge — source detail unavailable
- [No title in the source record — Edinburgh Research Explorer (University of Edinburgh)]→The Lack of A Priori Distinctions Between Learning AlgorithmsLegacy edge — source detail unavailable
- Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and …→The Lack of A Priori Distinctions Between Learning AlgorithmsLegacy edge — source detail unavailable
- The Lack of A Priori Distinctions Between Learning Algorithms→No free lunch theorems for optimizationLegacy edge — source detail unavailable
- The Lack of A Priori Distinctions Between Learning Algorithms→The Strength of Weak LearnabilityLegacy edge — source detail unavailable
- The Lack of A Priori Distinctions Between Learning Algorithms→On the mean accuracy of statistical pattern recognizersLegacy edge — source detail unavailable
- The Lack of A Priori Distinctions Between Learning Algorithms→The strength of weak learnabilityLegacy edge — source detail unavailable
- The Lack of A Priori Distinctions Between Learning Algorithms→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
- The Lack of A Priori Distinctions Between Learning Algorithms→Generalization as searchLegacy edge — source detail unavailable
- The Strength of Weak Learnability→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
- The strength of weak learnability→Learnability and the Vapnik-Chervonenkis dimensionLegacy edge — source detail unavailable
- [No title in the source record — Edinburgh Research Explorer (University of Edinburgh)]→A few useful things to know about machine learningLegacy edge — source detail unavailable
What this paper cites, inside the corpus
| Paper | Year | Cited |
|---|---|---|
| No free lunch theorems for optimization | 1997 | 14,234 |
| The Strength of Weak Learnability | 1990 | 3,344 |
| On the mean accuracy of statistical pattern recognizers | 1968 | 2,859 |
| The strength of weak learnability | 1990 | 2,477 |
| Learnability and the Vapnik-Chervonenkis dimension | 1989 | 1,855 |
| Generalization as search | 1982 | 1,442 |
What cites it, inside the corpus
Links
Topics
| Machine Learning and Algorithms | Computer Science |
| Computability, Logic, AI Algorithms | Computer Science |
| Complexity and Algorithms in Graphs | Computer Science |
Is this record sound?
complete
Nothing in this record contradicts itself and no field we check is missing.
- supports1 author record(s) attached.
- supports33 reference(s) recorded.
- supportsThe DOI's year agrees with the publication year.
- supportsA title is present.
Provenance
sha256 7bc26169e93749d1…