Amazon cover image
Image from Amazon.com

Inductive Logic Programming [electronic resource] : 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers /

Contributor(s): Material type: TextTextSeries: Lecture Notes in Artificial Intelligence ; 2583Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003Edition: 1st ed. 2003Description: X, 358 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540364689
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 005.1 23
LOC classification:
  • QA76.758
Online resources:
Contents:
Contributed Papers -- Propositionalization for Clustering Symbolic Relational Descriptions -- Efficient and Effective Induction of First Order Decision Lists -- Learning with Feature Description Logics -- An Empirical Evaluation of Bagging in Inductive Logic Programming -- Kernels for Structured Data -- Experimental Comparison of Graph-Based Relational Concept Learning with Inductive Logic Programming Systems -- Autocorrelation and Linkage Cause Bias in Evaluation of Relational Learners -- Learnability of Description Logic Programs -- 1BC2: A True First-Order Bayesian Classifier -- RSD: Relational Subgroup Discovery through First-Order Feature Construction -- Mining Frequent Logical Sequences with SPIRIT-LoG -- Using Theory Completion to Learn a Robot Navigation Control Program -- Learning Structure and Parameters of Stochastic Logic Programs -- A Novel Approach to Machine Discovery: Genetic Programming and Stochastic Grammars -- Revision of First-Order Bayesian Classifiers -- The Applicability to ILP of Results Concerning the Ordering of Binomial Populations -- Compact Representation of Knowledge Bases in ILP -- A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data -- A Genetic Algorithms Approach to ILP -- Experimental Investigation of Pruning Methods for Relational Pattern Discovery -- Noise-Resistant Incremental Relational Learning Using Possible Worlds -- Lattice-Search Runtime Distributions May Be Heavy-Tailed -- Invited Talk Abstracts -- Learning in Rich Representations: Inductive Logic Programming and Computational Scientific Discovery.
In: Springer Nature eBookSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Contributed Papers -- Propositionalization for Clustering Symbolic Relational Descriptions -- Efficient and Effective Induction of First Order Decision Lists -- Learning with Feature Description Logics -- An Empirical Evaluation of Bagging in Inductive Logic Programming -- Kernels for Structured Data -- Experimental Comparison of Graph-Based Relational Concept Learning with Inductive Logic Programming Systems -- Autocorrelation and Linkage Cause Bias in Evaluation of Relational Learners -- Learnability of Description Logic Programs -- 1BC2: A True First-Order Bayesian Classifier -- RSD: Relational Subgroup Discovery through First-Order Feature Construction -- Mining Frequent Logical Sequences with SPIRIT-LoG -- Using Theory Completion to Learn a Robot Navigation Control Program -- Learning Structure and Parameters of Stochastic Logic Programs -- A Novel Approach to Machine Discovery: Genetic Programming and Stochastic Grammars -- Revision of First-Order Bayesian Classifiers -- The Applicability to ILP of Results Concerning the Ordering of Binomial Populations -- Compact Representation of Knowledge Bases in ILP -- A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data -- A Genetic Algorithms Approach to ILP -- Experimental Investigation of Pruning Methods for Relational Pattern Discovery -- Noise-Resistant Incremental Relational Learning Using Possible Worlds -- Lattice-Search Runtime Distributions May Be Heavy-Tailed -- Invited Talk Abstracts -- Learning in Rich Representations: Inductive Logic Programming and Computational Scientific Discovery.

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.

There are no comments on this title.

to post a comment.
© 2024 IIIT-Delhi, library@iiitd.ac.in

Powered by Koha