The following pages link to (Q4413504):
Displayed 12 items.
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs (Q894703) (← links)
- Parallel ILP for distributed-memory architectures (Q1009328) (← links)
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause (Q1959491) (← links)
- Concept learning in description logics using refinement operators (Q1959551) (← links)
- Learning hierarchical probabilistic logic programs (Q2071314) (← links)
- On the use of stochastic local search techniques to revise first-order logic theories from examples (Q2361575) (← links)
- Lifted discriminative learning of probabilistic logic programs (Q2425249) (← links)
- Randomised restarted search in ILP (Q2433174) (← links)
- Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves (Q2433187) (← links)
- Improving inductive logic programming by using simulated annealing (Q2476777) (← links)
- MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement (Q2943874) (← links)
- Rapid Restart Hill Climbing for Learning Description Logic Concepts (Q5041768) (← links)