default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. ILP 2002: Sydney, Australia
- Stan Matwin, Claude Sammut:
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
Contributed Papers
- Isabelle Bournaud
, Mélanie Courtine, Jean-Daniel Zucker:
Propositionalization for Clustering Symbolic Relational Descriptions. 1-16 - Mary Elaine Califf:
Efficient and Effective Induction of First Order Decision Lists. 17-31 - Chad M. Cumby, Dan Roth:
Learning with Feature Description Logics. 32-47 - 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 - Thomas Gärtner, John W. Lloyd, Peter A. Flach:
Kernels for Structured Data. 66-83 - Jesus A. Gonzalez, Lawrence B. Holder, Diane J. Cook:
Experimental Comparison of Graph-Based Relational Concept Learning with Inductive Logic Programming Systems. 84-100 - David D. Jensen, Jennifer Neville:
Autocorrelation and Linkage Cause Bias in Evaluation of Relational Learners. 101-116 - Jörg-Uwe Kietz:
Learnability of Description Logic Programs. 117-132 - Nicolas Lachiche, Peter A. Flach:
1BC2: A True First-Order Bayesian Classifier. 133-148 - Nada Lavrac, Filip Zelezný, Peter A. Flach:
RSD: Relational Subgroup Discovery through First-Order Feature Construction. 149-165 - Cyrille Masson, François Jacquenet:
Mining Frequent Logical Sequences with SPIRIT-LoG. 166-181 - Stephen Moyle:
Using Theory Completion to Learn a Robot Navigation Control Program. 182-197 - Stephen H. Muggleton:
Learning Structure and Parameters of Stochastic Logic Programs. 198-206 - Alain Ratle, Michèle Sebag:
A Novel Approach to Machine Discovery: Genetic Programming and Stochastic Grammars. 207-222 - Kate Revoredo, Gerson Zaverucha:
Revision of First-Order Bayesian Classifiers. 223-237 - Ashwin Srinivasan:
The Applicability to ILP of Results Concerning the Ordering of Binomial Populations. 238-253 - Jan Struyf, Jan Ramon, Hendrik Blockeel:
Compact Representation of Knowledge Bases in ILP. 254-269 - 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 - Alireza Tamaddoni-Nezhad, Stephen H. Muggleton:
A Genetic Algorithms Approach to ILP. 285-300 - Irene Weber:
Experimental Investigation of Pruning Methods for Relational Pattern Discovery. 301-316 - James Westendorp:
Noise-Resistant Incremental Relational Learning Using Possible Worlds. 317-332 - Filip Zelezný, Ashwin Srinivasan, David Page:
Lattice-Search Runtime Distributions May Be Heavy-Tailed. 333-345
Invited Talk Abstract
- Saso Dzeroski:
Learning in Rich Representations: Inductive Logic Programming and Computational Scientific Discovery. 346-349
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-06 20:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
