Algorithmic Learning for Knowledge-Based Systems
Editat de Klaus P. Jantke, Steffen Langeen Limba Engleză Paperback – 9 aug 1995
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.
Preț: 333.02 lei
Preț vechi: 416.28 lei
-20% Nou
Puncte Express: 500
Preț estimativ în valută:
58.92€ • 68.64$ • 51.45£
58.92€ • 68.64$ • 51.45£
Carte tipărită la comandă
Livrare economică 17-31 ianuarie 26
Preluare comenzi: 021 569.72.76
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
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ă
ResearchCuprins
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.