Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework

[1]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[2]  David Haussler,et al.  Learning decision trees from random examples , 1988, COLT '88.

[3]  Leslie G. Valiant,et al.  A general lower bound on the number of examples needed for learning , 1988, COLT '88.

[4]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[5]  Prasad Tadepalli,et al.  Two New Frameworks for Learning , 1988, ML.

[6]  Ming Li,et al.  Learning in the presence of malicious errors , 1993, STOC '88.

[7]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[8]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[9]  David Haussler,et al.  Occam's Razor , 1987, Inf. Process. Lett..

[10]  Jeffrey C. Schlimmer.  Incremental Adjustment of Representations for Learning , 1987 .

[11]  M. Kearns,et al.  Recent Results on Boolean Concept Learning , 1987 .

[12]  Philip D. Laird.  Inductive Inference by Refinement , 1986, AAAI.

[13]  Joan Feigenbaum,et al.  Factorization in Experiment Generation , 1986, AAAI.

[14]  Alan Bundy,et al.  An Analytical Comparison of Some Rule-Learning Programs , 1985, Artif. Intell..

[15]  Ranan B. Banerji,et al.  The Logic of Learning: A Basis for Pattern Recognition and for Improvement of Performance , 1985, Adv. Comput..

[16]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[17]  Paul E. Utgoff,et al.  Shift of bias for inductive concept learning , 1984 .

[18]  Ryszard S. Michalski,et al.  A Theory and Methodology of Inductive Learning , 1983, Artificial Intelligence.

[19]  D. S. Johnson,et al.  On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..

[20]  Thomas G. Dietterich,et al.  A Comparative Review of Selected Methods for Learning from Examples , 1983 .

[21]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[22]  Richard M. Dudley,et al.  Some special vapnik-chervonenkis classes , 1981, Discret. Math..

[23]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[24]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[25]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[26]  Judea Pearl,et al.  ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS , 1978 .

[27]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[28]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[29]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

[30]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..