1 option
Inductive Logic Programming : 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers / edited by Jesse Davis, Jan Ramon.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence 2945-9141 ; 9046
- Lecture Notes in Artificial Intelligence, 2945-9141 ; 9046
- Language:
- English
- Subjects (All):
- Machine theory.
- Artificial intelligence.
- Computer programming.
- Application software.
- Computer science.
- Formal Languages and Automata Theory.
- Artificial Intelligence.
- Programming Techniques.
- Computer and Information Systems Applications.
- Computer Science Logic and Foundations of Programming.
- Theory of Computation.
- Local Subjects:
- Formal Languages and Automata Theory.
- Artificial Intelligence.
- Programming Techniques.
- Computer and Information Systems Applications.
- Computer Science Logic and Foundations of Programming.
- Theory of Computation.
- Physical Description:
- 1 online resource (X, 211 pages) : 62 illustrations in color.
- Edition:
- 1st ed. 2015.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-23708-4
- 9783319237084
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.