Inductive Logic Programming

13th International Conference, ILP 2003, Szeged, Hungary, September 29 - October 1, 2003. Proceedings

Editors:

ISBN: 978-3-540-20144-1 (Print) 978-3-540-39917-9 (Online)

Table of contents (25 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Invited Papers

    1. No Access

      Book Chapter

      Pages 1-1

      A Personal View of How Best to Apply ILP

    2. No Access

      Book Chapter

      Pages 2-3

      Agents that Reason and Learn

  3. Research Papers

    1. No Access

      Book Chapter

      Pages 4-21

      Mining Model Trees: A Multi-relational Approach

    2. No Access

      Book Chapter

      Pages 22-37

      Complexity Parameters for First-Order Classes

    3. No Access

      Book Chapter

      Pages 38-56

      A Multi-relational Decision Tree Learning Algorithm – Implementation and Experiments

    4. No Access

      Book Chapter

      Pages 57-74

      Applying Theory Revision to the Design of Distributed Databases

    5. No Access

      Book Chapter

      Pages 75-92

      Disjunctive Learning with a Soft-Clustering Method

    6. No Access

      Book Chapter

      Pages 93-111

      ILP for Mathematical Discovery

    7. No Access

      Book Chapter

      Pages 112-129

      An Exhaustive Matching Procedure for the Improvement of Learning Efficiency

    8. No Access

      Book Chapter

      Pages 130-145

      Efficient Data Structures for Inductive Logic Programming

    9. No Access

      Book Chapter

      Pages 146-163

      Graph Kernels and Gaussian Processes for Relational Reinforcement Learning

    10. No Access

      Book Chapter

      Pages 164-179

      On Condensation of a Clause

    11. No Access

      Book Chapter

      Pages 180-196

      A Comparative Evaluation of Feature Set Evolution Strategies for Multirelational Boosting

    12. No Access

      Book Chapter

      Pages 197-214

      Comparative Evaluation of Approaches to Propositionalization

    13. No Access

      Book Chapter

      Pages 215-232

      Ideal Refinement of Descriptions in \(\mathcal{AL}\) -Log

    14. No Access

      Book Chapter

      Pages 233-250

      Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?

    15. No Access

      Book Chapter

      Pages 251-268

      Improved Distances for Structured Data

    16. No Access

      Book Chapter

      Pages 269-280

      Induction of Enzyme Classes from Biological Databases

    17. No Access

      Book Chapter

      Pages 281-298

      Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars

    18. No Access

      Book Chapter

      Pages 299-310

      Induction of the Effects of Actions by Monotonic Methods

previous Page of 2