Algorithmic Learning Theory
Editat de Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmannen Limba Engleză Paperback – 23 sep 1998
Preț: 330.36 lei
Preț vechi: 412.95 lei
-20%
Puncte Express: 496
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: 9783540650133
ISBN-10: 354065013X
Pagini: 460
Ilustrații: XI, 444 p. 1 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:Softcover reprint of the original 1st edition 1998
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354065013X
Pagini: 460
Ilustrații: XI, 444 p. 1 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.69 kg
Ediția:Softcover reprint of the original 1st edition 1998
Editura: Springer
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.