Core Concepts
GraphMatcher, a new ontology matching system, uses a graph attention approach to compute higher-level representations of classes and their surrounding terms, demonstrating promising performance on the OAEI 2022 conference track.
Abstract
The GraphMatcher is a new ontology matching system that uses a graph representation learning approach based on graph attention. The key aspects are:
Preprocessing: The ontology data is preprocessed in six steps, including parsing, tokenization, abbreviation finding, stop word cleaning, neighborhood aggregation, and term embedding.
Heterogeneous Graph Attention Layer: The system applies graph attention to a heterogeneous graph composed of five homogeneous subgraphs, each representing a different relationship (e.g., subClassOf, equivalentClass) between the center class and its neighbors. This computes a higher-level representation of the center class and its context.
Output and Similarity Layers: The higher-level representations are downsampled, and the cosine similarity between the representations of class pairs is computed to determine the alignments.
The GraphMatcher demonstrates promising performance on the OAEI 2022 conference track, particularly in the M1 and M3 evaluation variants, where it achieves high F1-measures. However, it has lower performance on the M2 variant, which focuses on property alignments. The future work will aim to improve the property alignment capabilities of the system.
Stats
The GraphMatcher achieved the following results on the OAEI 2022 conference track:
Precision: 0.75 - 0.82
F.5-measure: 0.70 - 0.77
F1-measure: 0.63 - 0.71
F2-measure: 0.56 - 0.65
Recall: 0.53 - 0.62
Quotes
"The GraphMatcher demonstrates remarkable performance in the M1 and M3 evaluation variants in terms of F1-measure, even though it does not have high performance in the M2 evaluation variant."
"The GraphMatcher's confidence is higher than the other matchers evaluated in the OAEI 2022 conference track."