Learning k&mgr; decision trees on the uniform distribution

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Learning k&mgr; decision trees on the uniform distribution

Full text

Pdf (927 KB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the sixth annual conference on Computational learning theory table of contents

Santa Cruz, California, United States

Pages: 352 - 360

Year of Publication: 1993

ISBN:0-89791-611-5

Author

Thomas R. Hancock

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 16, Downloads (12 Months): 26, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/168304.168374 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AM91	William Aiello , Milena Mihail, Learning the Fourier spectrum of probabilistic lists and trees, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.291-299, January 28-30, 1991, San Francisco, California, United States
	BFOS84	L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth International Group, Belmont, CA, 1984.
	Bsh93	N.H. Bshouty. Exact learning. Unpublished manuscript, 1993.
	EH89	A. Ehrenfeucht , D. Haussler , M. Kearns, Learning decision trees from random examples needed for learning, Information and Computation, v.82 n.3, p.231-246, Sep. 1989 [doi>10.1016/0890-5401(89)90001-1]
	Han91	Thomas R. Hancock, Learning 2u DNF formulas and ku decision trees, Proceedings of the fourth annual workshop on Computational learning theory, p.199-212, August 05-07, 1991, Santa Cruz, California, United States
	Han92	Thomas Raysor Hancock, The complexity of learning formulas and decision trees that have restricted reads, Harvard University, Cambridge, MA, 1992
	HM91	Thomas Hancock , Yishay Mansour, Learning monotone ku DNF formulas on product distributions, Proceedings of the fourth annual workshop on Computational learning theory, p.179-183, August 05-07, 1991, Santa Cruz, California, United States
	HMS66	E. Hunt, J. Matin, and P. Stone. Experiments in Induction. Academic Press, New York, 1966.
	KM91	Eyal Kushilevitz , Yishay Mansour, Learning decision trees using the Fourier spectrum, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.455-464, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103466]
	Mas76	W. Masek. A fast algorithm for the string editing problem and decision graph complexity. Master's thesis, M.I.T., 1976.
	Min89	John Mingers, An Empirical Comparison of Selection Measures for Decision-Tree Induction, Machine Learning, v.3 n.4, p.319-342, March 1989 [doi>10.1023/A:1022645801436]
	Qui86	J. R. Quinlan, Induction of Decision Trees, Machine Learning, v.1 n.1, p.81-106 [doi>10.1023/A:1022643204877]
	Val84	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]