On the connection between the phase transition of the covering test and the learning success rate in ILP
From MaRDI portal
Publication:1009240
DOI10.1007/s10994-007-5031-9zbMath1470.68071OpenAlexW2002350735MaRDI QIDQ1009240
Publication date: 31 March 2009
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-007-5031-9
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items (1)
Uses Software
Cites Work
- Macro-operators: A weak method for learning
- Depth-first iterative-deepening: An optimal admissible tree search
- Top-down induction of first-order logical decision trees
- Phase transitions in relational learning
- ROC `n' rule learning -- towards a better understanding of covering algorithms
- 10.1162/153244304773936018
- Extension of the Top-Down Data-Driven Strategy to ILP
- Inductive Logic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the connection between the phase transition of the covering test and the learning success rate in ILP