DNF—if you can't learn'em, teach'em

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

DNF—if you can't learn'em, teach'em: an interactive model of teaching

Full text

Pdf (1.04 MB)

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: 222 - 229

Year of Publication: 1995

ISBN:0-89791-723-5

Author

H. David Mathias

Department of Computer Science, Washington University, St. Louis, MO

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): 17, Downloads (12 Months): 30, Citation Count: 4

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.225325 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.

	1	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	2	Dana Angluin , Mārtiņš Kriķis, Learning with malicious membership queries and exceptions (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.57-66, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181015]
	3	Dana Angluin , Donna K. Slonim, Learning monotone DNF with an incomplete membership oracle, Proceedings of the fourth annual workshop on Computational learning theory, p.139-146, August 05-07, 1991, Santa Cruz, California, United States
	4	Martin Anthony , Graham Brightwell , Dave Cohen , John Shawe-Taylor, On exact specification by examples, Proceedings of the fifth annual workshop on Computational learning theory, p.311-318, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130420]
	5	Nader H. Bshouty. Exact learning via the monotone theory. In 34th Ann. Syrup. on Foundations of Comp. Sci., November 1993.
	6	Nader H. Bshouty , Richard Cleve , Sampath Kannan , Christino Tamon, Oracles and queries that are sufficient for exact learning (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.130-139, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181067]
	7	Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, and H. David Mathias. Exact learning of discretized concepts. Tech. Report WUCS-94-19, Washington Univ., 1994.
	8	R. Freivalds , E. B. Kinber , R. Wiehagen, On the power of inductive inference from good examples, Theoretical Computer Science, v.110 n.1, p.131-144, March 15, 1993 [doi>10.1016/0304-3975(93)90353-U]
	9	Paul W. Goldberg , Sally A. Goldman , H. David Mathias, Learning unions of boxes with membership and equivalence queries, Proceedings of the seventh annual conference on Computational learning theory, p.198-207, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181102]
	10	Sally A. Goldman , H. David Mathias, Teaching a smart learner, Proceedings of the sixth annual conference on Computational learning theory, p.67-76, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168313]
	11	Sally A. Goldman , Michael J. Kearns, On the complexity of teaching, Proceedings of the fourth annual workshop on Computational learning theory, p.303-314, August 05-07, 1991, Santa Cruz, California, United States
	12	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]
	13	Jeffrey Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. In 35th Ann. Syrup. on Foundations of Comp. Sci., pages 42-53, November 1994.
	14	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]
	15	Steffen Lange , Rolf Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Computing, v.8 n.4, p.361-370, 1991 [doi>10.1007/BF03037093]
	16	B. K. Natarajan, On learning Boolean functions, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.296-304, January 1987, New York, New York, United States [doi>10.1145/28395.28427]
	17	Kathleen Romanik, Approximate testing and learnability, Proceedings of the fifth annual workshop on Computational learning theory, p.327-332, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130422]
	18	Kathleen Romanik , Carl Smith, Testing geometric objects, University of Maryland at College Park, College Park, MD, 1990
	19	Steven Salzberg, Arthur Delcher, David Heath, and Simon Kasif. Learning with a helpful teacher. In 12th International Joint Conference on Artificial Intelligence, pages 705-711, August 1991.
	20	Ayumi Shinohara , Satoru Miyano, Teachability in computational learning, New Generation Computing, v.8 n.4, p.337-347, 1991 [doi>10.1007/BF03037091]
	21	Robert H. Sloan , György Turán, Learning with queries but incomplete information (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.237-245, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181128]

CITED BY 4

	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
	Stephen S. Kwek, An apprentice learning model (extended abstract), Proceedings of the twelfth annual conference on Computational learning theory, p.63-74, July 07-09, 1999, Santa Cruz, California, United States
	Colin De La Higuera, Characteristic Sets for Polynomial Grammatical Inference, Machine Learning, v.27 n.2, p.125-138, May 1997
	Reza Ebrahimpour , Ehsanollah Kabir , Mohammad Reza Yousefi, Teacher-directed learning in view-independent face recognition with mixture of experts using overlapping eigenspaces, Computer Vision and Image Understanding, v.111 n.2, p.195-206, August, 2008