Skip to main content
SpringerLink
Log in

Remarks on computational learning theory

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

Some remarks are given on the history, the main results and the future research directions of computational learning theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Angluin, Computational learning theory: Survey and selected bibliography, in: Proc. of 24th Symposium on Theory of Computing (STOC) (1992) pp. 351-369.

  2. D. Angluin, M. Frazier and L. Pitt, Learning conjunctions of Horn clauses, Machine Learning 9 (1992) 147-164.

    MATH  Google Scholar 

  3. M. Anthony and N. Biggs, Computational Learning Theory: An Introduction (Cambridge University Press, Cambridge, England, 1992).

    Google Scholar 

  4. N.H. Bshouty, Exact learning via the monotone theory, Inform. Comput. 123 (1995) 146-153.

    Article  MathSciNet  Google Scholar 

  5. Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Systems Sci. 55 (1997) 119-139.

    Article  MATH  MathSciNet  Google Scholar 

  6. J.C. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, J. Comput. Systems Sci. 55 (1997) 414-440.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Kearns, Efficient noise-tolerant learning from statistical queries, J. ACM 45 (1998) 983-1006.

    Article  MATH  MathSciNet  Google Scholar 

  8. M.J. Kearns and Y. Mansour, On the boosting ability of top-down decision tree learning algorithms, in: Proc. of 28th Symposium on Theory of Computing (STOC) (1996) pp. 459-468.

  9. M.J. Kearns and U.V. Vazirani, An Introduction to Computational Learning Theory (MIT Press, Cambridge, MA, 1994).

    Google Scholar 

  10. R. Khardon and D. Roth, Learning to reason, J. ACM 44 (1997) 697-725.

    Article  MATH  MathSciNet  Google Scholar 

  11. N. Littlestone and M.K. Warmuth, The weighted majority algorithm, Inform. Comput. 108 (1994) 212-261.

    Article  MATH  MathSciNet  Google Scholar 

  12. Y. Mansour, Reinforcement learning and mistake-bounded algorithms, in: Proc. of 12th Conf. on Computing and Learning Theory (COLT) (1999) pp. 183-192.

  13. T.M. Mitchell, Machine Learning (McGraw-Hill, New York, 1997).

    Google Scholar 

  14. T.M. Mitchell, Machine learning and data mining, Comm. ACM 42 (1999) 31-36.

    Article  Google Scholar 

  15. B.K. Natarajan, Machine Learning: a Theoretical Approach (Morgan Kaufmann, San Mateo, CA, 1991).

    Google Scholar 

  16. L. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.

    Article  MATH  Google Scholar 

  17. V.N. Vapnik, Statistical Learning Theory (Wiley, New York, 1998).

    Google Scholar 

Download references

Authors
  1. György Turán
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Turán, G. Remarks on computational learning theory. Annals of Mathematics and Artificial Intelligence 28, 43–45 (2000). https://doi.org/10.1023/A:1018948021083

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018948021083

Keywords

Search

Navigation