Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Learning for Knowledge-Based Systems de Klaus P. Jantke

Algorithmic Learning for Knowledge-Based Systems

Editat de Klaus P. Jantke, Steffen Lange
en Limba Engleză Paperback – 9 aug 1995
This book is the final report on a comprehensive basic research project, named GOSLER on algorithmic learning for knowledge-based systems supported by the German Federal Ministry of Research and Technology during the years 1991 - 1994. This research effort was focused on the study of fundamental learnability problems integrating theoretical research with the development of tools and experimental investigation.
The contributions by 11 participants in the GOSLER project is complemented by contributions from 23 researchers from abroad. Thus the volume provides a competent introduction to algorithmic learning theory.
Citește tot Restrânge

Preț: 33404 lei

Preț vechi: 41755 lei
-20%

Puncte Express: 501

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 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783540602170
ISBN-10: 3540602178
Pagini: 532
Ilustrații: X, 522 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.8 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Learning and consistency.- Error detecting in inductive inference.- Learning from good examples.- Towards reduction arguments for FINite learning.- Not-so-nearly-minimal-size program inference (preliminary report).- Optimization problem in inductive inference.- On identification by teams and probabilistic machines.- Topological considerations in composing teams of learning machines.- Probabilistic versus deterministic memory limited learning.- Classification using information.- Classifying recursive predicates and languages.- A guided tour across the boundaries of learning recursive languages.- Pattern inference.- Inductive learning of recurrence-term languages from positive data.- Learning formal languages based on control sets.- Learning in case-based classification algorithms.- Optimal strategies — Learning from examples — Boolean equations.- Feature construction during tree learning.- On lower bounds for the depth of threshold circuits with weights from {?1,0,+1}.- Structuring neural networks and PAC-Learning.- Inductive synthesis of rewrite programs.- TLPS — A term rewriting laboratory (not only) for experiments in automatic program synthesis.- GoslerP — A logic programming tool for inductive inference.