1 option
Inductive Logic Programming : 13th International Conference, ILP 2003, Szeged, Hungary, September 29 - October 1, 2003, Proceedings / edited by Tamas Horváth, Akihiro Yamamoto.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 2835.
- Lecture Notes in Artificial Intelligence ; 2835
- Language:
- English
- Subjects (All):
- Software engineering.
- Artificial intelligence.
- Computer science.
- Computer programming.
- Logic, Symbolic and mathematical.
- Software Engineering/Programming and Operating Systems.
- Artificial Intelligence.
- Computer Science, general.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Artificial Intelligence.
- Computer Science, general.
- Programming Techniques.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (X, 406 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-39917-9
- 9783540399179
- 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.