A Model of Interactive Teaching

Journal of Computer and System Sciences

Volumn 54, Issue 3, 1997, Pages 487-501

  Mathias, H David ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; INTERACTIVE COMPUTER SYSTEMS; LEARNING SYSTEMS; TEACHING; USER INTERFACES;

EQUIVALENCE QUERIES; INTERACTIVE TEACHING; QUERY LEARNING MODEL;

COMPUTER AIDED INSTRUCTION;

EID: 0031165219     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1491     Document Type: Article

References (27)

1. D. Angluin, Queries and concept learning, Mach. Learning 2, No. 4 (1988), 319-342.
2. D. Angluin, personal communication, 1994.
3. D. Angluin and M. Krikis, Learning with malicious membership queries and exceptions, in "Proceedings, Seventh Annual ACM Conference on Computational Learning Theory, July 1994," pp. 57-66.
4. D. Angluin and D. K. Slonim, Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle, Mach. Learning 14, No. 1 (1994), 7-26.
5. M. Anthony, G. Brightwell, D. Cohen, and J. Shawe-Taylor, On exact specification by examples, in "Proceedings, Fifth Annual Workshop on Computational Learning Theory, July 1992," pp. 311-318.
6. N. H. Bshouty, Exact learning via the monotone theory, in "34th Annual Symposium on Foundations of Computer Science, November 1993."
7. N. H. Bshouty, R. Cleve, S. Kannan, and C. Tamon, Oracles and queries that are sufficient for exact learning, in "Proceedings, Seventh Annual ACM Conference on Computational Learning Theory, July 1994." pp. 130-139.
8. N. H. Bshouty, P. W. Goldberg, S. A. Goldman, and H. D. Mathias, "Exact Learning of Discretized Concepts," Technical Report WUCS-94-19, Washington University, 1994.
9. R. Freivalds, E. Kinber, and R. Wiehagen, Inference from good examples, Theoretical Computer Science 110 (1993), 131-144.
10. P. W. Goldberg, S. A. Goldman, and H. D. Mathias, Learning unions of boxes with membership and equivalence queries, in "Proceedings, Seventh Annual ACM Conference on Computational Learning Theory, July 1993."
11. S. Goldman and D. Mathias, Teaching a smarter learner, in "Proceedings, Sixth Annual ACM Conference on Computational Learning Theory," pp. 67-76, ACM Press, New York, NY, 1993. To appear, J Comput. System Sci..
12. S. A. Goldman and M. J. Kearns, On the complexity of teaching, J. Comput. System Sci. 50(1) (1995), 20-31.
13. S. A. Goldman, R. L. Rivest, and R. E. Schapire, Learning binary relations and total orders, SIAM Journal on Computing 22(5) (1993), 1006-1034.
14. S. A. Goldman and R. H. Sloan, The power of self-directed learning, Mach. Learning 14(3) (1994), 217-294.
15. T. Hegedus, Combinatorial results on the complexity of teaching and learning, in "Proceddings, 19th International Symposium on Mathematical Foundations of Computer Scinece," Springer-Verlag, New York/Berlin, 1994.
16. T. Hegedus, Generalized teaching dimensions and the query complexity of learning, in "Proceedings, Eighth Annual ACM Conference on Computational Learning Theory, July 1995."
17. J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, in "35th Annual Symposium on Foundations of Computer Science, November 1994," pp. 42-53.
18. J. Jackson and A. Tomkins, A computational model of teaching, in "Proceedings, Fifth Annual Workshop on Computational Learning Theory," pp. 319-326, ACM Press, New York, 1992.
19. M. J. Kearns, "The Computational Complexity of Machine Learning," MIT Press, Cambridge, MA, 1990.
20. S. Lange and R. Wiehagen, Polynomial-time inference of arbitrary pattern languages, New Generation Computing 8 (1991), 361-370.
21. B. K. Natarajan, On learning Boolean functions, in "Proceedings, Nineteenth Annual ACM Symposium on Theory of Computing, May 1987," pp. 296-304.
22. R. L. Rivest and Y. L. Yin, Being taught can be faster than asking questions, in "Proceedings, Eighth Annual ACM Conference on Computational Learning Theory, July 1995."
23. K. Romanik, Approximate testing and learnability, in "Proceedings, Fifth Annual Workshop on Computational Learning Theory," pp. 327-332, ACM Press, New York, 1992.
24. K. Romanik and C. Smith, "Testing Geometric Objects," Technical Report UMIACS-TR-90-69, University of Maryland College Park, Department of Computer Science, 1990.
25. S. Salzberg, A. Delcher, D. Heath, and S. Kasif, Learning with a helpful teacher, in "12th International Joint Conference on Artificial Intelligence, August 1991," pp. 705-711.
26. A. Shinohara and S. Miyano, Teachability in computational learning, New Generation Computing 8 (1991), 337-347.
27. R. H. Sloan and G. Turán, Learning with queries and incomplete information, in "Proceedings, Seventh Annual ACM Conference on Computational Learning Theory, July 1994," pp. 237-245.