Comparison of Subgraph Mining Algorithms on Ontologies


Senturk F., AYTAÇ V.

7th International Conference on Computer, Information and Telecommunication Systems (CITS), Colmar, France, 11 - 13 July 2018, pp.164-166 identifier identifier

  • Publication Type: Conference Paper / Full Text
  • Volume:
  • Doi Number: 10.1109/cits.2018.8440159
  • City: Colmar
  • Country: France
  • Page Numbers: pp.164-166

Abstract

Ontologies are metadata describing properties of a domain, instance data and relationships between properties, developed for many different purposes. But, they can be different names or properties even within the same domain. Ontology matching can be a solution to these differences. Ontology matching is a method for finding the same things in between existing ontologies by looking at semantic similarities. In this paper, we investigate whether current subgraph mining techniques can be used for ontology matching. In the literature, these subgraph mining techniques have not used for ontology matching, before. With this work, we are introducing subgraph-based approaches to ontology matching methods. For this purpose, we have tested two subgraph mining algorithm, GraMi and Gspan, and used human and adult mouse anatomy ontology. We have compared GraMi, and Gspan algorithms and found that Gspan is better than GraMi about matching results.