论文信息 - Learning decision trees from random examples - 字舞流文

Learning decision trees from random examples

David Haussler | Andrzej Ehrenfeucht | D. Haussler | A. Ehrenfeucht

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

[2] Ronald L. Rivest,et al. Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..

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

[4] David Haussler,et al. Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..

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

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

[7] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.

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