FEEDBACK Smiley face
Normal view MARC view ISBD view

Algorithmic Learning Theory [electronic resource] :8th International Workshop, ALT '97 Sendai, Japan, October 6–8, 1997 Proceedings /

Contributor(s): Li, Ming [editor.] | Maruoka, Akira [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence: 1316Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1997.Description: XIV, 470 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540696025.Subject(s): Computer science | Mathematical logic | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
Contents:
Program error detection/correction: Turning PAC learning into Perfect learning -- Team learning as a game -- Inferability of recursive real-valued functions -- Learning of R.E. Languages from good examples -- Identifiability of subspaces and homomorphic images of zero-reversible languages -- On exploiting knowledge and concept use in learning theory -- Partial occam's razor and its applications -- Derandomized learning of boolean functions -- Learning DFA from simple examples -- PAC learning under helpful distributions -- PAC learning using Nadaraya-Watson estimator based on orthonormal systems -- Monotone extensions of boolean data sets -- Classical Brouwer-Heyting-Kolmogorov interpretation -- Inferring a system from examples with time passage -- Polynomial time inductive inference of regular term tree languages from positive data -- Synthesizing noise-tolerant language learners -- Effects of Kolmogorov complexity present in inductive inference as well -- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries -- Oracles in ? 2 p are sufficient for exact learning -- Exact learning via teaching assistants (Extended abstract) -- An efficient exact learning algorithm for ordered binary decision diagrams -- Probability theory for the Brier game -- Learning and revising theories in noisy domains -- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces -- On the relevance of time in neural computation and learning -- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree -- Learning disjunctions of features -- Learning simple deterministic finite-memory automata -- Learning acyclic first-order horn sentences from entailment -- On learning disjunctions of zero-one threshold functions with queries.
In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 8th International Workshop on Algorithmic Learning Theory, ALT'97, held in Sendai, Japan, in October 1997. The volume presents 26 revised full papers selected from 42 submissions. Also included are three invited papers by leading researchers. Among the topics addressed are PAC learning, learning algorithms, inductive learning, inductive inference, learning from examples, game-theoretical aspects, decision procedures, language learning, neural algorithms, and various other aspects of computational learning theory.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Program error detection/correction: Turning PAC learning into Perfect learning -- Team learning as a game -- Inferability of recursive real-valued functions -- Learning of R.E. Languages from good examples -- Identifiability of subspaces and homomorphic images of zero-reversible languages -- On exploiting knowledge and concept use in learning theory -- Partial occam's razor and its applications -- Derandomized learning of boolean functions -- Learning DFA from simple examples -- PAC learning under helpful distributions -- PAC learning using Nadaraya-Watson estimator based on orthonormal systems -- Monotone extensions of boolean data sets -- Classical Brouwer-Heyting-Kolmogorov interpretation -- Inferring a system from examples with time passage -- Polynomial time inductive inference of regular term tree languages from positive data -- Synthesizing noise-tolerant language learners -- Effects of Kolmogorov complexity present in inductive inference as well -- Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries -- Oracles in ? 2 p are sufficient for exact learning -- Exact learning via teaching assistants (Extended abstract) -- An efficient exact learning algorithm for ordered binary decision diagrams -- Probability theory for the Brier game -- Learning and revising theories in noisy domains -- A note on a scale-sensitive dimension of linear bounded functionals in Banach Spaces -- On the relevance of time in neural computation and learning -- A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree -- Learning disjunctions of features -- Learning simple deterministic finite-memory automata -- Learning acyclic first-order horn sentences from entailment -- On learning disjunctions of zero-one threshold functions with queries.

This book constitutes the refereed proceedings of the 8th International Workshop on Algorithmic Learning Theory, ALT'97, held in Sendai, Japan, in October 1997. The volume presents 26 revised full papers selected from 42 submissions. Also included are three invited papers by leading researchers. Among the topics addressed are PAC learning, learning algorithms, inductive learning, inductive inference, learning from examples, game-theoretical aspects, decision procedures, language learning, neural algorithms, and various other aspects of computational learning theory.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in