1 option
Algorithmic Learning Theory : 12th International Conference, ALT 2001, Washington, DC, USA, November 25-28, 2001. Proceedings. / edited by Naoki Abe, Roni Khardon, Thomas Zeugmann.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 2225.
- Lecture Notes in Artificial Intelligence ; 2225
- Language:
- English
- Subjects (All):
- Computer programming.
- Artificial intelligence.
- Computers.
- Algorithms.
- Logic, Symbolic and mathematical.
- Natural language processing (Computer science).
- Programming Techniques.
- Artificial Intelligence.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Mathematical Logic and Formal Languages.
- Natural Language Processing (NLP).
- Local Subjects:
- Programming Techniques.
- Artificial Intelligence.
- Computation by Abstract Devices.
- Algorithm Analysis and Problem Complexity.
- Mathematical Logic and Formal Languages.
- Natural Language Processing (NLP).
- Physical Description:
- 1 online resource (XII, 388 pages).
- Edition:
- First edition 2001.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
- System Details:
- text file PDF
- Summary:
- This volume contains the papers presented at the 12th Annual Conference on Algorithmic Learning Theory (ALT 2001), which was held in Washington DC, USA, during November 25-28, 2001. The main objective of the conference is to provide an inter-disciplinary forum for the discussion of theoretical foundations of machine learning, as well as their relevance to practical applications. The conference was co-located with the Fourth International Conference on Discovery Science (DS 2001). The volume includes 21 contributed papers. These papers were selected by the program committee from 42 submissions based on clarity, signi?cance, o- ginality, and relevance to theory and practice of machine learning. Additionally, the volume contains the invited talks of ALT 2001 presented by Dana Angluin of Yale University, USA, Paul R. Cohen of the University of Massachusetts at Amherst, USA, and the joint invited talk for ALT 2001 and DS 2001 presented by Setsuo Arikawa of Kyushu University, Japan. Furthermore, this volume includes abstracts of the invited talks for DS 2001 presented by Lindley Darden and Ben Shneiderman both of the University of Maryland at College Park, USA. The complete versions of these papers are published in the DS 2001 proceedings (Lecture Notes in Arti?cial Intelligence Vol. 2226).
- Contents:
- Editors' Introduction
- Editors' Introduction
- Invited Papers
- The Discovery Science Project in Japan
- Queries Revisited
- Robot Baby 2001
- Discovering Mechanisms: A Computational Philosophy of Science Perspective
- Inventing Discovery Tools: Combining Information Visualization with Data Mining
- Complexity of Learning
- On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract)
- A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm
- Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard
- Support Vector Machines
- Learning of Boolean Functions Using Support Vector Machines
- A Random Sampling Technique for Training Support Vector Machines
- New Learning Models
- Learning Coherent Concepts
- Learning Intermediate Concepts
- Real-Valued Multiple-Instance Learning with Queries
- Online Learning
- Loss Functions, Complexities, and the Legendre Transformation
- Non-linear Inequalities between Predictive and Kolmogorov Complexities
- Inductive Inference
- Learning by Switching Type of Information
- Learning How to Separate
- Learning Languages in a Union
- On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes
- Refutable Inductive Inference
- Refutable Language Learning with a Neighbor System
- Learning Recursive Functions Refutably
- Refuting Learning Revisited
- Learning Structures and Languages
- Efficient Learning of Semi-structured Data from Queries
- Extending Elementary Formal Systems
- Learning Regular Languages Using RFSA
- Inference of ?-Languages from Prefixes.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45583-7
- 9783540455837
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.