Cantitate/Preț
Produs

Machine Learning: From Theory to Applications: Cooperative Research at Siemens and MIT: Lecture Notes in Computer Science, cartea 661

Editat de Stephen J. Hanson, Werner Remmele, Ronald L. Rivest
en Limba Engleză Paperback – 30 mar 1993
This volume includes some of the key research papers in thearea of machine learning produced at MIT and Siemens duringa three-year joint research effort. It includes papers onmany different styles of machine learning, organized intothree parts.Part I, theory, includes three papers on theoretical aspectsof machine learning. The first two use the theory ofcomputational complexity to derive some fundamental limitson what isefficiently learnable. The third provides anefficient algorithm for identifying finite automata.Part II, artificial intelligence and symbolic learningmethods, includes five papers giving an overview of thestate of the art and future developments in the field ofmachine learning, a subfield of artificial intelligencedealing with automated knowledge acquisition and knowledgerevision.Part III, neural and collective computation, includes fivepapers sampling the theoretical diversity and trends in thevigorous new research field of neural networks: massivelyparallel symbolic induction, task decomposition throughcompetition, phoneme discrimination, behavior-basedlearning, and self-repairing neural networks.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32586 lei

Preț vechi: 40732 lei
-20%

Puncte Express: 489

Preț estimativ în valută:
6243 6762$ 5354£

Carte tipărită la comandă

Livrare economică 06-13 mai

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540564836
ISBN-10: 3540564837
Pagini: 288
Ilustrații: VIII, 276 p.
Dimensiuni: 155 x 233 x 15 mm
Greutate: 0.91 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Strategic directions in machine learning.- Training a 3-node neural network is NP-complete.- Cryptographic limitations on learning Boolean formulae and finite automata.- Inference of finite automata using homing sequences.- Adaptive search by learning from incomplete explanations of failures.- Learning of rules for fault diagnosis in power supply networks.- Cross references are features.- The schema mechanism.- L-ATMS: A tight integration of EBL and the ATMS.- Massively parallel symbolic induction of protein structure/function relationships.- Task decomposition through competition in a modular connectionist architecture: The what and where vision tasks.- Phoneme discrimination using connectionist networks.- Behavior-based learning to control IR oven heating: Preliminary investigations.- Trellis codes, receptive fields, and fault tolerant, self-repairing neural networks.