A theory for memory-based learning

DOI10.1007/BF00993469zbMath0938.68796MaRDI QIDQ1342731

Jeffrey Scott Vitter, Jyh-Han Lin

Publication date: 21 June 2000

Published in: Machine Learning (Search for Journal in Brave)

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Networks and the best approximation property
• A new polynomial-time algorithm for linear programming
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Multivariate adaptive regression splines
• Equivalence of models for polynomial learnability
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Central limit theorems for empirical measures
• Universal classes of hash functions
• On the density of families of sets
• On the Complexity of Some Common Geometric Location Problems
• Automatic pattern recognition: a study of the probability of error
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A Greedy Heuristic for the Set-Covering Problem
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Data Storage in the Cerebellar Model Articulation Controller (CMAC)
• A New Approach to Manipulator Control: The Cerebellar Model Articulation Controller (CMAC)
• Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
• Nearest neighbor pattern classification
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Convergence of stochastic processes