On Learning Decision Trees with Large Output Domains
暂无分享,去创建一个
[1] Thomas R. Hancock,et al. Learning 2µ DNF Formulas and kµ Decision Trees , 1991, COLT.
[2] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .
[3] Marek Karpinski,et al. Learning read-once formulas with queries , 1993, JACM.
[4] David Haussler,et al. Learning decision trees from random examples , 1988, COLT '88.
[5] Thomas R. Hancock. Learning kμ decision trees on the uniform distribution , 1993, COLT '93.
[6] D. Angluin. Queries and Concept Learning , 1988 .
[7] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[8] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[9] Avrim Blum. Rank-r Decision Trees are a Subclass of r-Decision Lists , 1992, Inf. Process. Lett..
[10] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Nader H. Bshouty,et al. Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[12] Thomas Raysor Hancock. The complexity of learning formulas and decision trees that have restricted reads , 1992 .