Ontology Matching Using Graph Matching --- Results

We have performed experiments on the Benchmark tests. The algorithm applied is the the MaxComSubgraphAlgorithm with a VertexTypeEquality measure (two vertices are equal if they are both concepts or relations or attributes) and a Longest Common Subsequence (lcs) similarity measure for the vertices' labels. These two measures are concatenated with a conjunction.

To view the detailed precision and recall values for the Benchmark tests, as well as the Fallout, the F-Measure and the Overall measure, see this table.

The following figures show

F-Measure

Overall Measure

Back to the Graph Matching main page.