An algorithmic theory of learning: Robust concepts and random projection
- 28 March 2006
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 63 (2) , 161-182
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Boosting the margin: a new explanation for the effectiveness of voting methodsThe Annals of Statistics, 1998
- A neuroidal architecture for cognitive computation1998
- Efficient distribution-free learning of probabilistic conceptsJournal of Computer and System Sciences, 1994
- Recent views of conceptual structure.Psychological Bulletin, 1992
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A theory of the learnableCommunications of the ACM, 1984
- Basic objects in natural categoriesCognitive Psychology, 1976
- Perceptual vs conceptual categorizationMemory & Cognition, 1973
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954