Scaling Up Inductive Logic Programming by Learning from Interpretations
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming techniques are typically more expressive but also less efficient. Therefore, the data sets handled by current inductive logic programming systems are small according to general standards within the data mining community. The main source of inefficiency lies in the assumption that several examples may be related to each other, so they cannot be handled independently.Within the learning from interpretations framework for inductive logic programming this assumption is unnecessary, which allows to scale up existing ILP algorithms. In this paper we explain this learning setting in the context of relational databases. We relate the setting to propositional data mining and to the classical ILP setting, and show that learning from interpretations corresponds to learning from multiple relations and thus extends the expressiveness of propositional learning, while maintaining its efficiency to a large extent (which is not the case in the classical ILP setting).As a case study, we present two alternative implementations of the ILP system TILDE (Top-down Induction of Logical DEcision trees): TILDEclassic, which loads all data in main memory, and TILDELDS, which loads the examples one by one. We experimentally compare the implementations, showing TILDELDS can handle large data sets (in the order of 100,000 examples or 100 MB) and indeed scales up linearly in the number of examples.
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
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Solving the multiple instance problem with axis-parallel rectangles
Dietterich, T. G., Lathrop, R. H., & Lozano-Pérez, T. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(96)00034-3 · Cited by 2,866 · cited 1×
“Moreover, unless a multiple-instance learner is used (see e.g. (Dietterich et al., 1997)) all the atoms a molecule consists of, together with their properties, have to be stored in one tuple, so that an indefinite number of attributes is needed; see (De Raedt, 1998) for a more detailed discussion.”
MethodLearning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644 · cited 2×
“This contrasts with the large majority of inductive logic programming systems, such as FOIL ( Quinlan, 1990 ) or Progol (Muggleton, 1995), in which coverage is tested globally, i.e.”
BackgroundMuggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Top-down induction of first-order logical decision trees
Blockeel, H., & De Raedt, L. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00034-4 · Cited by 685
Self-citationQuinlan, J. R., & Cameron-Jones, R. M. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-56602-3_124 · Cited by 528 · cited 9×
“C4.5 only considers tests comparing an attribute with a value.”
BackgroundMethodInfluentialDe Raedt, L., & Dehaspe, L. (1997) · Machine Learning · doi:10.1023/a:1007361123060 · Cited by 235 · cited 1×
“At this moment few systems use the learning from interpretations setting (De Raedt and Van Laer, 1995; De Raedt and Dehaspe, 1997; Dehaspe and De Raedt, 1997).”
Background
Cited by
Relational Reinforcement Learning
Džeroski, S., De Raedt, L., & Driessens, K. (2001) · Machine Learning · doi:10.1023/a:1007694015589 · Cited by 371
“(Blockeel et al., 1999) and could improve the efficiency of RRL.”
A Survey of Methods for Scaling Up Inductive Algorithms
Provost, F., & Kolluri, V. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009876119989 · Cited by 277
ILP turns 20: Biography and future challenges
Muggleton, S., De Raedt, L., Poole, D., Bratko, I., Flach, P., Inoue, K., & Srinivasan, A. (2012) · Machine Learning · doi:10.1007/s10994-011-5259-2 · Cited by 126
The Game of Bridge: A Challenge for ILP
Legras, S., Rouveirol, C., & Ventos, V. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-99960-9_5 · Cited by 7
Metadata
- Authors
- Blockeel, H., De Raedt, L., Jacobs, N., & Demoen, B.
- Venue
- Data Mining and Knowledge Discovery
- Published
- 1999-03
- Volume
- 3
- Issue
- 1
- Pages
- 59-93
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W1501498539
- Cited by
- 103
- References
- 7
- FWCI
- 17.11
- Type
- journal article
- Language
- en
- Open access
- green
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
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.