A Monte Carlo Approach to Hard Relational Learning Problems

  • Authors:
  • Alessandro Serra;Attilio Giordana

  • Affiliations:
  • -;-

  • Venue:
  • AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A previous research has shown that most learning strategies fail to learn relational concepts when descriptions involving more than three variables are required. The reason resides in the emergence of a phase transition in the covering test. After an in depth analysis of this aspect, this paper proposes an alternative learning strategy, combining a Monte Carlo stochastic search with local deterministic search. This approach offers two main benefits: on the one hand, substantial advantages over more traditional search algorithms, in terms of increased learning ability, and, on the other, the possibility of an a- priori estimation of the cost for solving a learning problem, under specific assumptions about the target concept.