Teachability in computational learning-Reference-Cited by-同舟云学术

Teachability in computational learning

Published:1991-02 Issue:4 Volume:8 Page:337-347
ISSN:0288-3635
Container-title:New Generation Computing
language:en
Short-container-title:NGCO

Author:

Shinohara Ayumi,Miyano Satoru

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03037091.pdf

Reference10 articles.

1. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M.K., “Learnability and the Vapnik-Chervonenkis dimension”, Journal of the ACM, Vol. 36, No. 4, pp. 929–965, 1989.

2. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.

3. Haussler, D., Kearns, M., Littlestone, N., and Warmuth, M.K., “Equivalence of models for polynomial learnability”, in Proceedings of the 1st Workshop on Computational Learning Theory, Morgan Kaufmann, pp. 42–55, 1988.

4. Johnson, D.S., “Approximation algorithms for combinatorial problems”, Journal of Computer and System Sciences, Vol. 9, pp. 256–278, 1974.

5. Kearns, M., Li, M., Pitt, L., and Valiant, L., “On the learnability of boolean formulae”, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 285–295, 1987.

Cited by 57 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multi-Agent Strategy Explanations for Human-Robot Collaboration;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13

2. Time-constrained learning;Pattern Recognition;2023-10

3. Teaching Multiple Inverse Reinforcement Learners;Frontiers in Artificial Intelligence;2021-09-16

4. Optimization problems for machine learning: A survey;European Journal of Operational Research;2021-05

5. How do People Train a Machine?;Proceedings of the ACM on Human-Computer Interaction;2021-04-13