|Title||A Quasi-Metric for Machine Learning|
|Publication Type||Journal Papers|
|Year of Publication||2002|
|Authors||Gutiérrez-Naranjo, M. A., Alonso-Jiménez J. A., & Borrego-Díaz J.|
|Journal Title||Lecture Notes in Computer Science|
|Publisher||Springer Berlin / Heidelberg|
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.