Algorithmic Learning Theory: 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3734
Editat de Sanjay Jain, Hans Ulrich Simon, Etsuji Tomitaen Limba Engleză Paperback – 26 sep 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 741.34 lei
- 20% Preț: 340.22 lei
- 20% Preț: 343.43 lei
- 20% Preț: 315.18 lei
- 20% Preț: 327.41 lei
- 20% Preț: 1031.06 lei
- 20% Preț: 438.67 lei
- 20% Preț: 315.76 lei
- 20% Preț: 330.61 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 995.03 lei
- 20% Preț: 562.71 lei
- 20% Preț: 237.99 lei
- 20% Preț: 504.57 lei
- 20% Preț: 332.20 lei
- 15% Preț: 563.85 lei
- 20% Preț: 636.26 lei
- 5% Preț: 365.59 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.38 lei
- Preț: 370.38 lei
- 20% Preț: 172.68 lei
- 20% Preț: 315.76 lei
- 20% Preț: 662.78 lei
- 20% Preț: 256.26 lei
- 20% Preț: 440.36 lei
- 20% Preț: 626.79 lei
- 20% Preț: 566.70 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 579.38 lei
- 20% Preț: 301.94 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 330.61 lei
- 20% Preț: 1044.38 lei
- 20% Preț: 574.58 lei
- Preț: 399.17 lei
- 20% Preț: 802.24 lei
- 20% Preț: 569.11 lei
- 20% Preț: 1374.12 lei
- 20% Preț: 333.84 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.97 lei
Preț: 333.03 lei
Preț vechi: 416.28 lei
-20% Nou
Puncte Express: 500
Preț estimativ în valută:
63.74€ • 67.24$ • 53.12£
63.74€ • 67.24$ • 53.12£
Carte tipărită la comandă
Livrare economică 03-17 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540292425
ISBN-10: 354029242X
Pagini: 508
Ilustrații: XII, 491 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.7 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354029242X
Pagini: 508
Ilustrații: XII, 491 p.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.7 kg
Ediția:2005
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ă
ResearchCuprins
Editors’ Introduction.- Editors’ Introduction.- Invited Papers.- Invention and Artificial Intelligence.- The Arrowsmith Project: 2005 Status Report.- The Robot Scientist Project.- Algorithms and Software for Collaborative Discovery from Autonomous, Semantically Heterogeneous, Distributed Information Sources.- Training Support Vector Machines via SMO-Type Decomposition Methods.- Kernel-Based Learning.- Measuring Statistical Dependence with Hilbert-Schmidt Norms.- An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron.- Learning Causal Structures Based on Markov Equivalence Class.- Stochastic Complexity for Mixture of Exponential Families in Variational Bayes.- ACME: An Associative Classifier Based on Maximum Entropy Principle.- Constructing Multiclass Learners from Binary Learners: A Simple Black-Box Analysis of the Generalization Errors.- On Computability of Pattern Recognition Problems.- PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance.- Learnability of Probabilistic Automata via Oracles.- Learning Attribute-Efficiently with Corrupt Oracles.- Learning DNF by Statistical and Proper Distance Queries Under the Uniform Distribution.- Learning of Elementary Formal Systems with Two Clauses Using Queries.- Gold-Style and Query Learning Under Various Constraints on the Target Class.- Non U-Shaped Vacillatory and Team Learning.- Learning Multiple Languages in Groups.- Inferring Unions of the Pattern Languages by the Most Fitting Covers.- Identification in the Limit of Substitutable Context-Free Languages.- Algorithms for Learning Regular Expressions.- A Class of Prolog Programs with Non-linear Outputs Inferable from Positive Data.- Absolute Versus Probabilistic Classification in a Logical Setting.-Online Allocation with Risk Information.- Defensive Universal Learning with Experts.- On Following the Perturbed Leader in the Bandit Setting.- Mixture of Vector Experts.- On-line Learning with Delayed Label Feedback.- Monotone Conditional Complexity Bounds on Future Prediction Errors.- Non-asymptotic Calibration and Resolution.- Defensive Prediction with Expert Advice.- Defensive Forecasting for Linear Protocols.- Teaching Learners with Restricted Mind Changes.