An apprentice learning model (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An apprentice learning model (extended abstract)

Full text

Pdf (1.50 MB)

Source

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

Santa Cruz, California, United States

Pages: 63 - 74

Year of Publication: 1999

ISBN:1-58113-167-4

Author

Stephen S. Kwek

School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
Univ. of California, : University of California at Santa Cruz

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 18, Citation Count: 0

Additional Information:

references 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/307400.307413 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.

	AK97	Dana Angluin , Mārtiņš Kriķis, Teachers, learners and black boxes, Proceedings of the tenth annual conference on Computational learning theory, p.285-297, July 06-09, 1997, Nashville, Tennessee, United States [doi>10.1145/267460.267515]
	Ang88	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	BDD93	Shai Ben-David , Eli Dichterman, Learning with restricted focus of attention, Proceedings of the sixth annual conference on Computational learning theory, p.287-296, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168353]
	BDJ+96	Andreas Birkendorf , Eli Dichterman , Jeffrey Jackson , Norbert Klasner , Hans Ulrich Simon, On restricted-focus-of-attention learnability of Boolean functions, Proceedings of the ninth annual conference on Computational learning theory, p.205-216, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238098]
	BEHW89	Anselm Blumer , A. Ehrenfeucht , David Haussler , Manfred K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM (JACM), v.36 n.4, p.929-965, Oct. 1989 [doi>10.1145/76359.76371]
	BKKS98	Andreas Birkendorf , Norbert Klasner , Christian Kuhlmann , Hans U. Simon, Structural results about exact learning with unspecified attribute values, Proceedings of the eleventh annual conference on Computational learning theory, p.144-153, July 24-26, 1998, Madison, Wisconsin, United States [doi>10.1145/279943.279974]
	GGK97	Russell Greiner , Adam J. Grove , Alexander Kogan, Knowing what doesn't matter: exploiting the omission of irrelevant data, Artificial Intelligence, v.97 n.1-2, p.345-380, Dec. 1997 [doi>10.1016/S0004-3702(97)00048-9]
	GK95	Sally A. Goldman , Michael J. Kearns, On the complexity of teaching, Journal of Computer and System Sciences, v.50 n.1, p.20-31, Feb. 1995 [doi>10.1006/jcss.1995.1003]
	GKS97	Sally A. Goldman , Stephen S. Kwek , Stephen D. Scott, Learning from examples with unspecified attribute values (extended abstract), Proceedings of the tenth annual conference on Computational learning theory, p.231-242, July 06-09, 1997, Nashville, Tennessee, United States [doi>10.1145/267460.267504]
	GLR98	David Guijarro , Víctor Lavín , Vijay Raghavan, Exact Learning when Irrelevant Variables Abound, Proceedings of the 4th European Conference on Computational Learning Theory, p.91-100, March 29-31, 1999
	GM96	Sally A. Goldman , H. David Mathias, Teaching a smarter learner, Journal of Computer and System Sciences, v.52 n.2, p.255-267, April 1996 [doi>10.1006/jcss.1996.0020]
	Han89	T. Hancock. Identifying /~-decision trees and p-formulas with constrained instance queries. Manuscript, Harvard University, 1989.
	JT92	Jeffrey Jackson , Andrew Tomkins, A computational model of teaching, Proceedings of the fifth annual workshop on Computational learning theory, p.319-326, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130421]
	KR95	Roni Khardon , Dan Roth, Learning to reason with a restricted view, Proceedings of the eighth annual conference on Computational learning theory, p.301-310, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225335]
	Lit88	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]
	Mat95	H. David Mathias, DNF—if you can't learn'em, teach'em: an interactive model of teaching, Proceedings of the eighth annual conference on Computational learning theory, p.222-229, July 05-08, 1995, Santa Cruz, California, United States [doi>10.1145/225298.225325]
	PV88	Leonard Pitt , Leslie G. Valiant, Computational limitations on learning from examples, Journal of the ACM (JACM), v.35 n.4, p.965-984, Oct. 1988 [doi>10.1145/48014.63140]
	SG94	Dale Schuurmans and Russell Greiner. Learning default concepts. In Proceedings of the Tenth Canadian Conference on Artificial Intelligence, pages 519-523, 1994.
	SG97	Dale Schuurmans , Russell Greiner, Learning to classify incomplete examples, Computational learning theory and natural learning systems: Volume IV: making learning systems practical, MIT Press, Cambridge, MA, 1997
	SM91	Ayumi Shinohara , Satoru Miyano, Teachability in computational learning, New Generation Computing, v.8 n.4, p.337-347, 1991 [doi>10.1007/BF03037091]
	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]