Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2225)
Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (27 papers)
-
Front Matter
-
Editors’ Introduction
About this book
Keywords
- Algorithmic Learning
- Computational Learning
- Concept Learning
- Discovery Science
- Inductive Inference
- Learning Algorithms
- Machine Learning
- Neural Network Learning
- Support Vector Machine
- Support Vector Machines
- algorithmic learning theory
- algorithms
- complexity
- learning
- learning theory
- algorithm analysis and problem complexity
Editors and Affiliations
-
IBM, Thomas J.Watson Research Center, Yorktown, USA
Naoki Abe
-
Dept.of Electrical Engineering and Computer Science, Tufts University, Medford, USA
Roni Khardon
-
Medizinische Universität zu Lübeck,Inst.für Theoretische Informatik, Lübeck, Germany
Thomas Zeugmann
Bibliographic Information
Book Title: Algorithmic Learning Theory
Book Subtitle: 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings.
Editors: Naoki Abe, Roni Khardon, Thomas Zeugmann
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45583-3
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42875-6Published: 07 November 2001
eBook ISBN: 978-3-540-45583-7Published: 30 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 388
Topics: Programming Techniques, Artificial Intelligence, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages, Natural Language Processing (NLP)