Muutke küpsiste eelistusi

Inductive Logic Programming: 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers 1st ed. 2015 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 211 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 62 Illustrations, color; X, 211 p. 62 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Artificial Intelligence 9046
  • Ilmumisaeg: 27-Dec-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319237071
  • ISBN-13: 9783319237077
  • Pehme köide
  • Hind: 46,85 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 55,12 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 211 pages, kõrgus x laius: 235x155 mm, kaal: 454 g, 62 Illustrations, color; X, 211 p. 62 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Artificial Intelligence 9046
  • Ilmumisaeg: 27-Dec-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319237071
  • ISBN-13: 9783319237077
This book constitutes the thoroughly refereed post-conference proceedings of the 24rd International Conference on Inductive Logic Programming, ILP 2014, held in Nancy, France, in September 2013.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.

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.