Similarity Measures for Computing Relaxed Instances

The notion of concept similarity is central to several ontology tasks and can be employed to realize relaxed versions of classical reasoning services. In this paper we investigate the reasoning service of answering instance queries in a relaxed fashion, where the query concept is relaxed by means of a concept similarity measure (CSM). To this end we investigate CSMs that assess the similarity of EL-concepts defined w.r.t. a general EL-TBox. We derive such a family of CSMs from a family of similarity measures for finite interpretations and show in both cases that the resulting measures enjoy a collection of formal properties. These properties allow us to devise an algorithm for computing relaxed instances w.r.t. general EL-TBoxes, where users can specify the ‘appropriate’ notion of similarity by instanciating our CSM appropriately.

[1]  Thomas Lengauer,et al.  A new measure for functional similarity of gene products based on Gene Ontology , 2006, BMC Bioinformatics.

[2]  Anni-Yasmin Turhan,et al.  A Framework for Semantic-based Similarity Measures for ELH-Concepts , 2012 .

[3]  S. Banach.  Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales , 1922 .

[4]  Carsten Lutz,et al.  Deciding inseparability and conservative extensions in the description logic EL , 2010, J. Symb. Comput..

[5]  Steffen Staab,et al.  On the Influence of Description Logics Ontologies on Conceptual Similarity , 2008, EKAW.

[6]  M. Ashburner,et al.  Gene Ontology: tool for the unification of biology , 2000, Nature Genetics.

[7]  Changhui Yan,et al.  A Graph-Based Semantic Similarity Measure for the gene Ontology , 2011, J. Bioinform. Comput. Biol..

[8]  Ralf Küsters,et al.  Approximating most specific concepts in description logics with existential restrictions , 2002, AI Commun..

[9]  Paul Pavlidis,et al.  Gene Ontology term overlap as a measure of gene functional similarity , 2008, BMC Bioinformatics.

[10]  Rafael Peñaloza,et al.  A Practical Approach for Computing Generalization Inferences in EL\mathcal{EL} , 2011, ESWC.

[11]  Anni-Yasmin Turhan,et al.  Most Specific Generalizations w.r.t. General EL-TBoxes , 2013, IJCAI.

[12]  Ralf Küsters,et al.  Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.

[13]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[14]  Rafael Peñaloza,et al.  Answering for Concepts Relaxed by Similarity Measures , 2013 .