Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/inductive-logic-programming/descriptif_3961153
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3961153

Inductive Logic Programming, 1st ed. 2015 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers Lecture Notes in Artificial Intelligence Series

Langue : Anglais

Coordonnateurs : Davis Jesse, Ramon Jan

Couverture de l’ouvrage Inductive Logic Programming

This book constitutes the thoroughly refereed post-conference proceedings of the 24th International Conference on Inductive Logic Programming, ILP 2014, held in Nancy, France, in September 2014.

The 14 revised papers presented were carefully reviewed and selected from 41 submissions. The papers focus on topics such as the inducing of logic programs, learning from data represented with logic, multi-relational machine learning, learning from graphs, and applications of these techniques to important problems in fields like bioinformatics, medicine, and text mining.

Reframing on Relational Data.- Inductive Learning using Constraint-driven Bias.- Nonmonotonic Learning in Large Biological Networks.- Construction of Complex Aggregates with Random Restart Hill-Climbing.- Logical minimisation of meta-rules within Meta-Interpretive Learning.- Goal and plan recognition via parse trees using prefix and infix probability computation.- Effectively creating weakly labeled training examples via approximate domain knowledge.- Learning Prime Implicant Conditions From Interpretation Transition.- Statistical Relational Learning for Handwriting Recognition.- The Most Probable Explanation for Probabilistic Logic Programs with Annotated Disjunctions.- Towards machine learning of predictive models from ecological data.- PageRank, ProPPR, and Stochastic Logic Programs.- Complex aggregates over clusters of elements.- On the Complexity of Frequent Subtree Mining in Very Simple Structures.

Includes supplementary material: sn.pub/extras