Inductive Logic Programming
Editat de Gerson Zaverucha, Vítor Santos Costa, Aline Paesen Limba Engleză Paperback – 7 oct 2014
The 9 revised extended papers were carefully reviewed and selected from 42 submissions. The conference now focuses on all aspects of learning in logic, multi-relational learning and data mining, statistical relational learning, graph and tree mining, relational reinforcement learning, and other forms of learning from structured data.
Preț: 259.94 lei
Preț vechi: 324.93 lei
-20%
Puncte Express: 390
Preț estimativ în valută:
45.97€ • 52.71$ • 39.73£
45.97€ • 52.71$ • 39.73£
Carte tipărită la comandă
Livrare economică 28 aprilie-12 mai
Specificații
ISBN-13: 9783662449226
ISBN-10: 3662449226
Pagini: 156
Ilustrații: XIII, 141 p. 31 illus.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:2014
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3662449226
Pagini: 156
Ilustrații: XIII, 141 p. 31 illus.
Dimensiuni: 155 x 235 x 9 mm
Greutate: 0.25 kg
Ediția:2014
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement.- On Differentially Private Inductive Logic Programming.- Learning Through Hypothesis Refinement Using Answer Set Programming.- A BDD-Based Algorithm for Learning from Interpretation Transition.- Accelerating Imitation Learning in Relational Domains via Transfer by Initialization.- A Direct Policy-Search Algorithm for Relational Reinforcement Learning.- AND Parallelism for ILP: The APIS System.- Generalized Counting for Lifted Variable Elimination.- A FOIL-Like Method for Learning under Incompleteness and Vagueness.