Sciweavers

47
Voted
ML
2000
ACM

Phase Transitions in Relational Learning

13 years 11 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent published results, which show that many hard problems exhibit a narrow "phase transition" with respect to some order parameter, coupled with a large increase in computational complexity. First we show that matching a class of artificially generated Horn clauses on ground instances presents a typical phase transition in solvability with respect to both the number of literals in the clause and the number of constants occurring in the instance to match. Then, we demonstrate that phase transitions also appear in real-world learning problems, and that learners tend to generate inductive hypotheses lying exactly on the phase transition. On the other hand, an extensive experimenting revealed that not every matching problem inside the phase transition region is intractable. However, unfortunately, identifying those...
Attilio Giordana, Lorenza Saitta
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where ML
Authors Attilio Giordana, Lorenza Saitta
Comments (0)