| Skip to main content | Skip to navigation |

Constructing Virtual Documents for Ontology Matching

  • Yuzhong Qu, Department of Computer Science and Engineering, Southeast University, China
  • Wei Hu, Department of Computer Science and Engineering, Southeast University, China
  • Gong Cheng, Department of Computer Science and Engineering, Southeast University, China

Full text:

Track: Semantic Web

Slot: 11:00-12:30, Wednesday 24th May

On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in this paper. Basically, as a collection of weighted words, the virtual document of a URIref declared in an ontology contains not only the local descriptions but also the neighboring information to reflect the intended meaning of the URIref. Document similarity can be computed by traditional vector space techniques, and then be used in the similaritybased approaches to ontology matching. In particular, the RDF graph structure is exploited to define the description formulations and the neighboring operations. Experimental results show that linguistic matching based on the virtual documents is dominant in average F-Measure as compared to other three approaches. It is also demonstrated by our experiments that the virtual documents approach is cost-effective as compared to other linguistic matching approaches.

Organised by

ECS Logo

in association with

BCS Logo ACM Logo

Platinum Sponsors

Sponsor of The CIO Dinner

Valid XHTML 1.0! IFIP logo WWW Conference Committee logo Web Consortium logo Valid CSS!