An empirical study of the use of relevance information in inductive logic programming
The DOI matches its OpenAlex record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Inductive Logic Programming (ILP) systems construct models for data using domain-specific back-ground information. When using these systems, it is typically assumed that sufficient human exper-tise is at hand to rule out irrelevant background information. Such irrelevant information can, and typically does, hinder an ILP system’s search for good models. Here, we provide evidence that if expertise is available that can provide a partial-ordering on sets of background predicates in terms of relevance to the analysis task, then this can be used to good effect by an ILP system. In particu-lar, using data from biochemical domains, we investigate an incremental strategy of including sets of predicates in decreasing order of relevance. Results obtained suggest that: (a) the incremental approach identifies, in substantially less time, a model that is comparable in predictive accuracy to that obtained with all background information in place; and (b) the incremental approach using the relevance ordering performs better than one that does not (that is, one that adds sets of predicates randomly). For a practitioner concerned with use of ILP, the implication of these findings are two-fold: (1) when not all background information can be used at once (either due to limitations of the ILP system, or the nature of the domain) expert assessment of the relevance of background pred-icates can assist substantially in the construction of good models; and (2) good “first-cut ” results can be obtained quickly by a simple exclusion of information known to be less relevant.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Muggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Quinlan, J. R., & Cameron-Jones, R. M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_124 · Cited by 528
Cited by
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
Inductive logic programming at 30
Cropper, A., Dumančić, S., Evans, R., & Muggleton, S. H. (2022) · Machine Learning · doi:10.1007/s10994-021-06089-1 · Cited by 61
Knowledge Refactoring for Inductive Program Synthesis
Dumancic, S., Guns, T., & Cropper, A. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i8.16893 · Cited by 2
Forgetting to Learn Logic Programs
Cropper, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5776
Metadata
- Authors
- Srinivasan, A., King, R. D., & Bain, M.
- Published
- 2003-12-01
- Volume
- 4
- Pages
- 369-383
- DOI
- 10.5555/945365.945387
- OpenAlex
- W2116908954
- Cited by
- 29
- References
- 3
- FWCI
- 6.17
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An empirical study of the use of relevance information in inductive logic programming. https://app.cochat.ai/papers/10.5555/945365.945387
- The paper
- Srinivasan, A., King, R. D., & Bain, M. (2003). An empirical study of the use of relevance information in inductive logic programming. https://doi.org/10.5555/945365.945387
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.