On self-directed learning

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On self-directed learning

Full text

Pdf (749 KB)

Source

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

Santa Cruz, California, United States

Pages: 136 - 143

Year of Publication: 1995

ISBN:0-89791-723-5

Authors

Shai Ben-David	Computer Science Department, Technion, Haifa 32000, Israel
Nadav Eiron	Computer Science Department, Technion, Haifa 32000, Israel
Eyal Kushilevitz	Computer Science Department, Technion, Haifa 32000, Israel

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, 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/225298.225314 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.

	A88	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	BKM94	Shai Ben-David , Eyal Kushilevitz , Yishay Mansour, Online learning versus offline learning, Proceedings of the Second European Conference on Computational Learning Theory, p.38-52, March 13-15, 1995
	B90a	A. Blum, "Separating distribution-free and mistake-bound learning models over the Boolean domain" Proceedings of Focsgo, pp. 211-218, 1990.
	B90b	A. Blum, Learning boolean functions in an infinite attribute space, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.64-72, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100224]
	B92	Avrim Blum, Rank-r decision trees are a subclass of r-decision lists, Information Processing Letters, v.42 n.4, p.183-185, June 19, 1992 [doi>10.1016/0020-0190(92)90237-P]
	CM92	Zhixiang Chen , Wolfgang Maass, On-line learning of rectangles, Proceedings of the fifth annual workshop on Computational learning theory, p.16-28, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130387]
	CLR90	T.H. Cormen, C. E. Leiserson, and R. L. Rivest. Algorithms. MIT Press, 1990.
	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]
	GRS93	Sally A. Goldman , Ronald L. Rivest , Robert E. Schapire, Learning binary relations and total orders, SIAM Journal on Computing, v.22 n.5, p.1006-1034, Oct. 1993 [doi>10.1137/0222062]
	GS94	Sally A. Goldman , Robert H. Sloan, The Power of Self-Directed Learning, Machine Learning, v.14 n.3, p.271-294, March 1994 [doi>10.1023/A:1022605628675]
	HLL92	D.P. Helmbold, N. Littlestone, and P.M. Long, "Apple tasting and nearly one-sided learning", Proceedings of FOCS92, pp. 493-502, 1992.
	L88	Nick Littlestone, Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm, Machine Learning, v.2 n.4, p.285-318, April 1988 [doi>10.1023/A:1022869011914]
	L89	N. Littlestone, Mistake bounds and logarithmic linear-threshold learning algorithms, University of California at Santa Cruz, Santa Cruz, CA, 1990
	LW89	N. Littlestone, M. K. Warmuth, "The weighted majority algorithm", Proceedings of FOCS89, pp. 256-261, 1989.
	M91	Wolfgang Maass, On-line learning with an oblivious environment and the power of randomization, Proceedings of the fourth annual workshop on Computational learning theory, p.167-178, August 05-07, 1991, Santa Cruz, California, United States
	MT92	Wolfgang Maass , György Turán, Lower Bound Methods and Separation Results for On-Line Learning Models, Machine Learning, v.9 n.2-3, p.107-145, July 1992 [doi>10.1007/BF00992674]