ct. We are interested in dealing with the heterogeneity of Knowledge bases (KBs), e.g., ontologies and schemas, modeled as sets of entity types (etypes), e.g., person, where each etype is associated with a set of properties, e.g., age or height, via an inheritance hierarchy. A huge literature exists on this topic. A common approach is to model KBs as graphs decorated with labels and reduce the problem of KB matching to t hat of matching these two elements, viz., labels and structure of the graph. However, labels of etypes are often misplaced, e.g., they are more general or specific than the correct etype, as defined by its properties. Structurebased matching may also lead to wrong conclusions as the properties assigned to an etype in a inheritance hierarchy do not depend on the order by which they are assigned and, therefore, on the specific structure of the graph. In this paper, we propose a novel etype graph matching approach, dealing with the two problems highlighted above, based on two key ideas. The first is to implement matching as a classification task where etypes are characterized by the associated properties. The second is we propose two property-based etype similarity metrics, which model the roles that properties have in the definition of an etype. The experimental results show the effectiveness of the algorithm, in particular for those etype graphs with a high number of properties.

Property-based Entity Type Graph Matching / Giunchiglia, Fausto; Shi, Daqian. - 3063:(2021), pp. 1-12. (Intervento presentato al convegno OM WORKSHOP 2021 tenutosi a Online nel October 25th 2021).

Property-based Entity Type Graph Matching

Fausto Giunchiglia;Daqian Shi
2021-01-01

Abstract

ct. We are interested in dealing with the heterogeneity of Knowledge bases (KBs), e.g., ontologies and schemas, modeled as sets of entity types (etypes), e.g., person, where each etype is associated with a set of properties, e.g., age or height, via an inheritance hierarchy. A huge literature exists on this topic. A common approach is to model KBs as graphs decorated with labels and reduce the problem of KB matching to t hat of matching these two elements, viz., labels and structure of the graph. However, labels of etypes are often misplaced, e.g., they are more general or specific than the correct etype, as defined by its properties. Structurebased matching may also lead to wrong conclusions as the properties assigned to an etype in a inheritance hierarchy do not depend on the order by which they are assigned and, therefore, on the specific structure of the graph. In this paper, we propose a novel etype graph matching approach, dealing with the two problems highlighted above, based on two key ideas. The first is to implement matching as a classification task where etypes are characterized by the associated properties. The second is we propose two property-based etype similarity metrics, which model the roles that properties have in the definition of an etype. The experimental results show the effectiveness of the algorithm, in particular for those etype graphs with a high number of properties.
2021
ONTOLOGY MATCHING WORKSHOP, ISWC 2021
Online Proceedings
OM, ISWC 2021
Giunchiglia, Fausto; Shi, Daqian
Property-based Entity Type Graph Matching / Giunchiglia, Fausto; Shi, Daqian. - 3063:(2021), pp. 1-12. (Intervento presentato al convegno OM WORKSHOP 2021 tenutosi a Online nel October 25th 2021).
File in questo prodotto:
File Dimensione Formato  
2021_ISWC_OM_workshop___Property_based_Entity_Type_Graph_Matching (1) (1).pdf

accesso aperto

Tipologia: Post-print referato (Refereed author’s manuscript)
Licenza: Creative commons
Dimensione 303.07 kB
Formato Adobe PDF
303.07 kB Adobe PDF Visualizza/Apri
om2021_LTpaper3 (1).pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Creative commons
Dimensione 505.92 kB
Formato Adobe PDF
505.92 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/319691
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact