Improving inductive logic programming by using simulated annealing
From MaRDI portal
Publication:2476777
Recommendations
Cites work
- A genetic algorithm for propositionalization
- A genetic algorithms approach to ILP
- A refinement operator for theories
- Annealing stochastic approximation Monte Carlo algorithm for neural network training
- Cooling Schedules for Optimal Annealing
- Foundations of inductive logic programming
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 1015105 (Why is no real title available?)
- Inductive Logic Programming
- Inductive Logic Programming: Theory and methods
- Lattice-search runtime distributions may be heavy-tailed
- Learnability of description logic programs
- Learning structure and parameters of stochastic logic programs
- Logic programs and connectionist networks
- Optimization by simulated annealing
- Searching the subsumption lattice by a genetic algorithm
- The nature of statistical learning theory.
Cited in
(3)
This page was built for publication: Improving inductive logic programming by using simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476777)