Measuring Similarity in Description Logics Using Refinement Operators [chapter]

Antonio A. Sánchez-Ruiz, Santiago Ontañón, Pedro Antonio González-Calero, Enric Plaza
2011 Lecture Notes in Computer Science  
Similarity assessment is a key operation in many artificial intelligence fields, such as case-based reasoning, instance-based learning, ontology matching, clustering, etc. This paper presents a novel measure for assessing similarity between individuals represented using Description Logic (DL). We will show how the ideas of refinement operators and refinement graph, originally introduced for inductive logic programming, can be used for assessing similarity in DL and also for abstracting away
more » ... the specific DL being used. Specifically, similarity of two individuals is assessed by first computing their most specific concepts, then the least common subsumer of these two concepts, and finally measuring their distances in the refinement graph.
doi:10.1007/978-3-642-23291-6_22 fatcat:2gtiv3djcndolegjsymyyep5wu