12. ILP 2002:
Sydney,
Australia
Stan Matwin, Claude Sammut (Eds.):
Inductive Logic Programming, 12th International Conference, ILP 2002, Sydney, Australia, July 9-11, 2002. Revised Papers.
Lecture Notes in Computer Science 2583 Springer 2003, ISBN 3-540-00567-6 BibTeX
@proceedings{DBLP:conf/ilp/2002,
editor = {Stan Matwin and
Claude Sammut},
title = {Inductive Logic Programming, 12th International Conference, ILP
2002, Sydney, Australia, July 9-11, 2002. Revised Papers},
booktitle = {ILP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2583},
year = {2003},
isbn = {3-540-00567-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Contributed Papers
- Isabelle Bournaud, Mélanie Courtine, Jean-Daniel Zucker:
Propositionalization for Clustering Symbolic Relational Descriptions.
1-16
Electronic Edition (Springer LINK) BibTeX
- Mary Elaine Califf:
Efficient and Effective Induction of First Order Decision Lists.
17-31
Electronic Edition (Springer LINK) BibTeX
- Chad M. Cumby, Dan Roth:
Learning with Feature Description Logics.
32-47
Electronic Edition (Springer LINK) BibTeX
- Inês de Castro Dutra, David Page, Vítor Santos Costa, Jude W. Shavlik:
An Empirical Evaluation of Bagging in Inductive Logic Programming.
48-65
Electronic Edition (Springer LINK) BibTeX
- Thomas Gärtner, John W. Lloyd, Peter A. Flach:
Kernels for Structured Data.
66-83
Electronic Edition (Springer LINK) BibTeX
- Jesus A. Gonzalez, Lawrence B. Holder, Diane J. Cook:
Experimental Comparison of Graph-Based Relational Concept Learning with Inductive Logic Programming Systems.
84-100
Electronic Edition (Springer LINK) BibTeX
- David Jensen, Jennifer Neville:
Autocorrelation and Linkage Cause Bias in Evaluation of Relational Learners.
101-116
Electronic Edition (Springer LINK) BibTeX
- Jörg-Uwe Kietz:
Learnability of Description Logic Programs.
117-132
Electronic Edition (Springer LINK) BibTeX
- Nicolas Lachiche, Peter A. Flach:
1BC2: A True First-Order Bayesian Classifier.
133-148
Electronic Edition (Springer LINK) BibTeX
- Nada Lavrac, Filip Zelezný, Peter A. Flach:
RSD: Relational Subgroup Discovery through First-Order Feature Construction.
149-165
Electronic Edition (Springer LINK) BibTeX
- Cyrille Masson, François Jacquenet:
Mining Frequent Logical Sequences with SPIRIT-LoG.
166-181
Electronic Edition (Springer LINK) BibTeX
- Stephen Moyle:
Using Theory Completion to Learn a Robot Navigation Control Program.
182-197
Electronic Edition (Springer LINK) BibTeX
- Stephen Muggleton:
Learning Structure and Parameters of Stochastic Logic Programs.
198-206
Electronic Edition (Springer LINK) BibTeX
- Alain Ratle, Michèle Sebag:
A Novel Approach to Machine Discovery: Genetic Programming and Stochastic Grammars.
207-222
Electronic Edition (Springer LINK) BibTeX
- Kate Revoredo, Gerson Zaverucha:
Revision of First-Order Bayesian Classifiers.
223-237
Electronic Edition (Springer LINK) BibTeX
- Ashwin Srinivasan:
The Applicability to ILP of Results Concerning the Ordering of Binomial Populations.
238-253
Electronic Edition (Springer LINK) BibTeX
- Jan Struyf, Jan Ramon, Hendrik Blockeel:
Compact Representation of Knowledge Bases in ILP.
254-269
Electronic Edition (Springer LINK) BibTeX
- Yusuke Suzuki, Kohtaro Inomae, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida:
A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data.
270-284
Electronic Edition (Springer LINK) BibTeX
- Alireza Tamaddoni-Nezhad, Stephen Muggleton:
A Genetic Algorithms Approach to ILP.
285-300
Electronic Edition (Springer LINK) BibTeX
- Irene Weber:
Experimental Investigation of Pruning Methods for Relational Pattern Discovery.
301-316
Electronic Edition (Springer LINK) BibTeX
- James Westendorp:
Noise-Resistant Incremental Relational Learning Using Possible Worlds.
317-332
Electronic Edition (Springer LINK) BibTeX
- Filip Zelezný, Ashwin Srinivasan, David Page:
Lattice-Search Runtime Distributions May Be Heavy-Tailed.
333-345
Electronic Edition (Springer LINK) BibTeX
Invited Talk Abstract
Copyright © Sat May 16 23:23:36 2009
by Michael Ley (ley@uni-trier.de)