Algorithmic Learning Theory: 9th International Conference, ALT’98, Otzenhausen, Germany, October 8–10, 1998 Proceedings: Lecture Notes in Computer Science, cartea 1501
Editat de Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmannen Limba Engleză Paperback – 23 sep 1998
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ț: 330.79 lei
Preț vechi: 413.49 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
63.31€ • 65.99$ • 52.70£
63.31€ • 65.99$ • 52.70£
Carte tipărită la comandă
Livrare economică 04-18 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540650133
ISBN-10: 354065013X
Pagini: 460
Ilustrații: XI, 444 p. 1 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 1998
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: 354065013X
Pagini: 460
Ilustrații: XI, 444 p. 1 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.64 kg
Ediția:Softcover reprint of the original 1st ed. 1998
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.- Inductive Logic Programming and Data Mining.- Scalability Issues in Inductive Logic Programming.- Inductive Inference.- Learning to Win Process-Control Games Watching Game-Masters.- Closedness Properties in EX-Identification of Recursive Functions.- Learning via Queries.- Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries.- Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions.- Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries.- Computational Aspects of Parallel Attribute-Efficient Learning.- PAC Learning from Positive Statistical Queries.- Prediction Algorithns.- Structured Weight-Based Prediction Algorithms.- Inductive Logic Programming.- Learning from Entailment of Logic Programs with Local Variables.- Logical Aspects of Several Bottom-Up Fittings.- Learnability of Translations from Positive Examples.- Analysis of Case-Based Representability of Boolean Functions by Monotone Theory.- Learning Formal Languages.- Locality, Reversibility, and Beyond: Learning Languages from Positive Data.- Synthesizing Learners Tolerating Computable Noisy Data.- Characteristic Sets for Unions of Regular Pattern Languages and Compactness.- Finding a One-Variable Pattern from Incomplete Data.- A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases.- Inductive Inference.- A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions.- Predictive Learning Models for Concept Drift.- Learning with Refutation.- Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints.- Learning Algebraic Structures from TextUsing Semantical Knowledge.- Inductive Logic Programming.- Lime: A System for Learning Relations.- Miscellaneous.- On the Sample Complexity for Neural Trees.- Learning Sub-classes of Monotone DNF on the Uniform Distribution.- Using Attribute Grammars for Description of Inductive Inference Search Space.- Towards the Validation of Inductive Learning Systems.- Consistent Polynomial Identification in the Limit.
Caracteristici
Includes supplementary material: sn.pub/extras