Resource-bounded Relational Reasoning: Induction and Deduction Through Stochastic Matching
Machine Learning - Special issue on multistrategy learning
Ilp: a short look back and a longer look forward
The Journal of Machine Learning Research
Relational learning as search in a critical region
The Journal of Machine Learning Research
QG/GA: a stochastic search for Progol
Machine Learning
A genetic algorithms approach to ILP
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Hi-index | 0.00 |
A search approach is presented, based on a novel algorithm called QG (Quick Generalisation). QG carries out a random-restart stochastic bottom-up search which efficiently generates a consistent clause on the fringe of the refinement graph search without needing to explore the graph in detail. We use a Genetic Algorithm (GA) to evolve and re-combine clauses generated by QG. Initial experiments with QG/GA indicate that this approach can be more efficient than standard refinement-graph searches, while generating similar or better solutions.