Algorithmic Learning Theory
Editat de Klaus P. Jantke, Shigenobu Kobayashi, Etsuji Tomita, Takashi Yokomorien Limba Engleză Paperback – 20 oct 1993
Preț: 329.51 lei
Preț vechi: 411.90 lei
-20%
Puncte Express: 494
Carte tipărită la comandă
Livrare economică 08-22 iulie
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: 9783540573708
ISBN-10: 3540573704
Pagini: 444
Ilustrații: XI, 428 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.67 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540573704
Pagini: 444
Ilustrații: XI, 428 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.67 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Identifying and using patterns in sequential data.- Learning theory toward Genome Informatics.- Optimal layered learning: A PAC approach to incremental sampling.- Reformulation of explanation by linear logic toward logic for explanation.- Towards efficient inductive synthesis of expressions from input/output examples.- A typed ?-calculus for proving-by-example and bottom-up generalization procedure.- Case-based representation and learning of pattern languages.- Inductive resolution.- Generalized unification as background knowledge in learning logic programs.- Inductive inference machines that can refute hypothesis spaces.- On the duality between mechanistic learners and what it is they learn.- On aggregating teams of learning machines.- Learning with growing quality.- Use of reduction arguments in determining Popperian FIN-type learning capabilities.- Properties of language classes with finite elasticity.- Uniform characterizations of various kinds of language learning.- How to invent characterizable inference methods for regular languages.- Neural Discriminant Analysis.- A new algorithm for automatic configuration of Hidden Markov Models.- On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions.- On the sample complexity of consistent learning with one-sided error.- Complexity of computing Vapnik-Chervonenkis dimension.- ?-approximations of k-label spaces.- Exact learning of linear combinations of monotone terms from function value queries.- Thue systems and DNA — A learning algorithm for a subclass.- The VC-dimensions of finite automata with n states.- Unifying learning methods by colored digraphs.- A perceptual criterion for visually controlling learning.- Learning strategies using decision lists.- A decomposition basedinduction model for discovering concept clusters from databases.- Algebraic structure of some learning systems.- Induction of probabilistic rules based on rough set theory.