Cantitate/Preț
Produs
Total produse
Vezi coșul
Algorithmic Learning Theory: 7th International Workshop, ALT '96, Sydney, Australia, October 23 - 25, 1996. Proceedings de Setsuo Arikawa

Algorithmic Learning Theory: 7th International Workshop, ALT '96, Sydney, Australia, October 23 - 25, 1996. Proceedings: Lecture Notes in Computer Science, cartea 1160

Editat de Setsuo Arikawa, Arun K. Sharma
en Limba Engleză Paperback – 9 oct 1996
This book constitutes the refereed proceedings of the 7th International Workshop on Algorithmic Learning Theory, ALT '96, held in Sydney, Australia, in October 1996.
The 16 revised full papers presented were selected from 41 submissions; also included are eight short papers as well as four full length invited contributions by Ross Quinlan, Takeshi Shinohara, Leslie Valiant, and Paul Vitanyi, and an introduction by the volume editors. The book covers all areas related to algorithmic learning theory, ranging from theoretical foundations of machine learning to applications in several areas.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32613 lei

Preț vechi: 40766 lei
-20% Nou

Puncte Express: 489
Preț estimativ în valută:
6242€ • 6506$ • 5196£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540618638
ISBN-10: 3540618635
Pagini: 364
Ilustrații: XVII, 337 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:1996
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ă

Research

Cuprins

Managing complexity in neuroidal circuits.- Learnability of exclusive-or expansion based on monotone DNF formulas.- Improved bounds about on-line learning of smooth functions of a single variable.- Query learning of bounded-width OBDDs.- Learning a representation for optimizable formulas.- Limits of exact algorithms for inference of minimum size finite state machines.- Genetic fitness optimization using rapidly mixing Markov chains.- The kindest cut: Minimum message length segmentation.- Reducing complexity of decision trees with two variable tests.- The complexity of exactly learning algebraic concepts.- Efficient learning of real time two-counter automata.- Cost-sensitive feature reduction applied to a hybrid genetic algorithm.- Effects of Feature Selection with ‘Blurring’ on neurofuzzy systems.- Boosting first-order learning.- Incorporating hypothetical knowledge into the process of inductive synthesis.- Induction of Constraint Logic Programs.- Constructive learning of translations based on dictionaries.- Inductive logic programming beyond logical implication.- Noise elimination in inductive concept learning: A case study in medical diagnosis.- MML estimation of the parameters of the spherical fisher distribution.- Learning by erasing.- On learning and co-learning of minimal programs.- Inductive inference of unbounded unions of pattern languages from positive data.- A class of prolog programs inferable from positive data.- Vacillatory and BC learning on noisy data.- Transformations that preserve learnability.- Probabilistic limit identification up to “small” sets.- Reflecting inductive inference machines and its improvement by therapy.