Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2003

Inductive Logic Programming

12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers

Editors:

  1. Stan Matwin

    1. School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Claude Sammut

    1. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2583)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Conference series link(s): ILP: International Conference on Inductive Logic Programming

Conference proceedings info: ILP 2002.

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (23 papers)

  1. Front Matter

    Pages I-X
    PDF

  2. Contributed Papers

    1. Propositionalization for Clustering Symbolic Relational Descriptions

      • Isabelle Bournaud, Mélanie Courtine, Jean-Daniel Zucker
      Pages 1-16

    3. Learning with Feature Description Logics

      • Chad M. Cumby, Dan Roth
      Pages 32-47

    4. An Empirical Evaluation of Bagging in Inductive Logic Programming

      • Inês de Castro Dutra, David Page, Vítor Santos Costa, Jude Shavlik
      Pages 48-65

    5. Kernels for Structured Data

      • Thomas Gärtner, John W. Lloyd, Peter A. Flach
      Pages 66-83

    8. Learnability of Description Logic Programs

      • Jörg-Uwe Kietz
      Pages 117-132

    9. 1BC2: A True First-Order Bayesian Classifier

      • Nicolas Lachiche, Peter A. Flach
      Pages 133-148

    10. RSD: Relational Subgroup Discovery through First-Order Feature Construction

      • Nada Lavrač, Filip Železný, Peter A. Flach
      Pages 149-165

    11. Mining Frequent Logical Sequences with SPIRIT-LoG

      • Cyrille Masson, François Jacquenet
      Pages 166-182

    15. Revision of First-Order Bayesian Classifiers

      • Kate Revoredo, Gerson Zaverucha
      Pages 223-237

    17. Compact Representation of Knowledge Bases in ILP

      • Jan Struyf, Jan Ramon, Hendrik Blockeel
      Pages 254-269

    18. A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data

      • Yusuke Suzuki, Kohtaro Inomae, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida
      Pages 270-284

    19. A Genetic Algorithms Approach to ILP

      • Alireza Tamaddoni-Nezhad, Stephen Muggleton
      Pages 285-300
Back to top

Other Volumes

  1. Inductive Logic Programming

Back to top

About this book

The Twelfth International Conference on Inductive Logic Programming was held in Sydney, Australia, July 9–11, 2002. The conference was colocated with two other events, the Nineteenth International Conference on Machine Learning (ICML2002) and the Fifteenth Annual Conference on Computational Learning Theory (COLT2002). Startedin1991,InductiveLogicProgrammingistheleadingannualforumfor researchers working in Inductive Logic Programming and Relational Learning. Continuing a series of international conferences devoted to Inductive Logic Programming and Relational Learning, ILP 2002 was the central event in 2002 for researchers interested in learning relational knowledge from examples. The Program Committee, following a resolution of the Community Me- ing in Strasbourg in September 2001, took upon itself the issue of the possible change of the name of the conference. Following an extended e-mail discussion, a number of proposed names were subjected to a vote. In the ?rst stage of the vote, two names were retained for the second vote. The two names were: Ind- tive Logic Programming, and Relational Learning. It had been decided that a 60% vote would be needed to change the name; the result of the vote was 57% in favor of the name Relational Learning. Consequently, the name Inductive Logic Programming was kept.
Back to top

Keywords

Back to top

Editors and Affiliations

  • School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada

    Stan Matwin

  • School of Computer Science and Engineering, University of New South Wales, Sydney, Australia

    Claude Sammut

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation