Cantitate/Preț
Produs

Inductive Logic Programming

Editat de Tamas Horváth, Akihiro Yamamoto
en Limba Engleză Paperback – 24 sep 2003

Preț: 32810 lei

Preț vechi: 41013 lei
-20%

Puncte Express: 492

Carte tipărită la comandă

Livrare economică 07-21 iulie

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ă.

Specificații

ISBN-13: 9783540201441
ISBN-10: 3540201440
Pagini: 416
Ilustrații: X, 406 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.63 kg
Ediția:2003
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Papers.- A Personal View of How Best to Apply ILP.- Agents that Reason and Learn.- Research Papers.- Mining Model Trees: A Multi-relational Approach.- Complexity Parameters for First-Order Classes.- A Multi-relational Decision Tree Learning Algorithm – Implementation and Experiments.- Applying Theory Revision to the Design of Distributed Databases.- Disjunctive Learning with a Soft-Clustering Method.- ILP for Mathematical Discovery.- An Exhaustive Matching Procedure for the Improvement of Learning Efficiency.- Efficient Data Structures for Inductive Logic Programming.- Graph Kernels and Gaussian Processes for Relational Reinforcement Learning.- On Condensation of a Clause.- A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting.- Comparative Evaluation of Approaches to Propositionalization.- Ideal Refinement of Descriptions in -Log.- Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?.- Improved Distances for Structured Data.- Induction of Enzyme Classes from Biological Databases.- Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars.- Induction of the Effects of Actions by Monotonic Methods.- Hybrid Abductive Inductive Learning: A Generalisation of Progol.- Query Optimization in Inductive Logic Programming by Reordering Literals.- Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data.- Relational IBL in Music with a New Structural Similarity Measure.- An Effective Grammar-Based Compression Algorithm for Tree Structured Data.