wiki:GraphMatchingResults

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 the F-Measure and the Overall Measure for the maximum common subgraph method. The used threshold with values 1.0, 0.9, 0.8 and 0.7 (in this order from left to right) indicates how similar the vertices' labels are. The value 1.0 refers to label equality according to th lcs similarity measure.

F-Measure

Overall Measure

Back to the Graph Matching main page.

Last modified 12 years ago Last modified on 06/28/06 11:36:58

Attachments (9)

Download all attachments as: .zip