Ultra-strong machine learning: comprehensibility of programs learned with ILP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 788036 (Why is no real title available?)
- Analytical Inductive Functional Programming
- Argument based machine learning
- ILP turns 20. Biography and future challenges
- Inductive synthesis of functional programs: an explanation based generalization approach
- Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited
- Meta-interpretive learning: application to grammatical inference
Cited in
(13)- Learning any memory-less discrete semantics for dynamical systems represented by logic programs
- Inductive logic programming at 30
- Making sense of sensory input
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Making sense of raw input
- Editable machine learning models? A rule-based framework for user studies of explainability
- scientific article; zbMATH DE number 7455700 (Why is no real title available?)
- Generating contrastive explanations for inductive logic programming based on a near miss approach
- Beneficial and harmful explanatory machine learning
- Top program construction and reduction for polynomial time meta-interpretive learning
- Explainable and interpretable machine learning and data mining
- Some thoughts on knowledge-enhanced machine learning
- On cognitive preferences and the plausibility of rule-based models
This page was built for publication: Ultra-strong machine learning: comprehensibility of programs learned with ILP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1621886)