Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Learning Theory: 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings de Ming Li

Algorithmic Learning Theory: 8th International Workshop, ALT '97, Sendai, Japan, October 6-8, 1997. Proceedings: Lecture Notes in Computer Science, cartea 1316

Editat de Ming Li, Akira Maruoka
en Limba Engleză Paperback – 17 sep 1997
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33590 lei

Preț vechi: 41987 lei
-20% Nou

Puncte Express: 504
Preț estimativ în valută:
6428€ • 6697$ • 5345£

Carte tipărită la comandă

Livrare economică 11-25 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540635772
ISBN-10: 3540635777
Pagini: 484
Ilustrații: XIV, 470 p.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 disjunctionsof zero-one threshold functions with queries.