Generalisation through negation and predicate invention
The ability to generalise from a small number of examples is a fundamental challenge in machine learning. To tackle this challenge, we introduce an inductive logic programming (ILP) approach that combines negation and predicate invention. Combining these two features allows an ILP system to generali...
| Κύριοι συγγραφείς: | , |
|---|---|
| Μορφή: | Conference item |
| Γλώσσα: | English |
| Έκδοση: |
Association for the Advancement of Artificial Intelligence
2024
|
| Περίληψη: | The ability to generalise from a small number of examples is a fundamental challenge in machine learning. To tackle this challenge, we introduce an inductive logic programming (ILP) approach that combines negation and predicate invention. Combining these two features allows an ILP system to generalise better by learning rules with universally quantified body-only variables. We implement our idea in NOPI, which can learn normal logic programs with predicate invention, including Datalog programs with stratified negation. Our experimental results on multiple domains show that our approach can improve predictive accuracies and learning times. |
|---|