Guiding the search in the NO region of the phase transition problem with a partial subsumption test

Authors:
Samuel Wieczorek;Gilles Bisson;Mirta B. Gordon
Affiliations:
Laboratoire Biologie, Informatique, Mathématiques CEA-DSV-DRDC, Grenoble, France;Laboratoire Leibniz-IMAG, UMR 5522, Grenoble, France;Laboratoire Leibniz-IMAG, UMR 5522, Grenoble, France
Venue:
ECML'06 Proceedings of the 17th European conference on Machine Learning
Year:
2006

Citing 8
Cited 2

Removing redundancy from a clause

Artificial Intelligence
Phase transitions and the search problem

Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Learning Function-Free Horn Expressions

Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Phase Transitions in Relational Learning

Machine Learning
Relational learning as search in a critical region

The Journal of Machine Learning Research
Query transformations for improving the efficiency of ilp systems

The Journal of Machine Learning Research
Fast Theta-Subsumption with Constraint Satisfaction Algorithms

Machine Learning
Learning in FOL with a similarity measure

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

A General Similarity Framework for Horn Clause Logic

Fundamenta Informaticae
A General Similarity Framework for Horn Clause Logic

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a test, named π-subsumption, which computes partial subsumptions between a hypothesis h and an example e, as well as a measure, the subsumption index, which quantifies the covering degree between h and e. The behavior of this measure is studied on the phase transition problem.