Algorithmic Learning Theory
Editat de Naoki Abe, Roni Khardon, Thomas Zeugmannen Limba Engleză Paperback – 7 noi 2001
Preț: 327.27 lei
Preț vechi: 409.09 lei
-20%
Puncte Express: 491
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540428756
ISBN-10: 3540428755
Pagini: 400
Ilustrații: XII, 388 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540428755
Pagini: 400
Ilustrații: XII, 388 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.