A Model to Study Phase Transition and Plateaus in Relational Learning
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244304773936018
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- Extension of the Top-Down Data-Driven Strategy to ILP
- scientific article; zbMATH DE number 67803 (Why is no real title available?)
- scientific article; zbMATH DE number 1448978 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- Inductive Logic Programming
- Locating the phase transition in binary constraint satisfaction problems
- On the connection between the phase transition of the covering test and the learning success rate in ILP
- Phase transitions in relational learning
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Subsumption and implication
- The hardest constraint problems: A double phase transition
Cited in
(4)- On the connection between the phase transition of the covering test and the learning success rate in ILP
- Phase transitions in relational learning
- scientific article; zbMATH DE number 1630010 (Why is no real title available?)
- Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
This page was built for publication: A Model to Study Phase Transition and Plateaus in Relational Learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543267)