Cognitive Computing A research blog by Ashwin Ram, PhD

Retrieval of structured cases using similarity has been studied in CBR but there has been less activity on defining similarity on description logics (DL). We present an approach that allows us to present two similarity measures for feature logics, a subfamily of DLs, based on the concept of “refinement lattice”. The first one is based on computing the anti-unification (AU) of two cases to assess the amount of shared information. The second measure decomposes the cases into a set of independent “properties”, and then assesses how many of these properties are shared between the two cases. Moreover, we show that the defined measures are applicable to any representation language for which a refinement lattice can be defined. We empirically evaluate our measures comparing them to other measures in the literature in a variety of relational data sets showing very good results.

Read the paper:

On Similarity Measures based on a Refinement Lattice

by Santi Ontañón and Enric Plaza

www.cc.gatech.edu/faculty/ashwin/papers/er-09-11.pdf