GMO: A Graph Matching for Ontologies

By Wei Hu, Ningsheng Jian, Yuzhong Qu, Yanbing Wang. 2005

137 citations recorded by the source corpus.

Subfields: Graph Learning

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Graph Learning

1. Simon Lacoste-Julien
2. Zoubin Ghahramani

Citations in the corpus

• SIGMa: simple greedy matching for aligning large knowledge bases (2012, positive): “The idea to propagate information on a relationship graph has been used in several other approaches for ontology matching [14, 21], though none were scalable for the size of knowledge bases that we considered.”
• Ontology matching: A literature review (2015, methodology): “FalconAO (Hu & Qu, 2008) obtains the alignment between the input ontologies by internally running two algorithms, a linguistic one (LMO) (Zhang, Hu, & Qu, 2011) as a first step, to then use the alignments provided as an external output for the graph matching algorithm (GMO) (Hu, Jian, Qu, & Wang, 20”