A Quasi-Metric for Machine Learning

Authors:
Miguel A. Gutiérrez-Naranjo;José A. Alonso-Jiménez;Joaquín Borrego-Díaz
Affiliations:
-;-;-
Venue:
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2002

Citing 4
Cited 0

Learning from good and bad data

Learning from good and bad data
Implication of clauses is undecidable

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Metrics on Terms and Clauses

ECML '97 Proceedings of the 9th European Conference on Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

The subsumption relation is crucial in the Machine Learning systems based on a clausal representation. In this paper we present a class of operators for Machine Learning based on clauses which is a characterization of the subsumption relation in the following sense: The clause C1 subsumes the clause C2 iff C1 can be reached from C2 by applying these operators. In the second part of the paper we give a formalization of the closeness among clauses based on these operators and an algorithm to compute it as well as a bound for a quick estimation.