4.4 Article Proceedings Paper

Ontology mapping: as a binary classification problem

Journal

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE
Volume 23, Issue 9, Pages 1010-1025

Publisher

WILEY
DOI: 10.1002/cpe.1633

Keywords

ontology mapping; binary classification; machine learning; Semantic Web

Ask authors/readers for more resources

Ontology mapping (OM) seeks to find semantic correspondences between similar elements of different ontologies. OM is critical to achieve semantic interoperability in the World Wide Web. To solve the OM problem, this article proposes a non-instance learning-based approach that transforms the OM problem into a binary classification problem and utilizes machine learning techniques as a solution. Same as other machine learning-based approaches, a number of features (i.e. linguistic, structural, and web features) are generated for each mapping candidate. However, in contrast to other learning-based mapping approaches, the features proposed in our approach are generic and do not rely on the existence and sufficiency of instances. Therefore, our approach can be generalized to different domains without extra training efforts. To evaluate our approach, two experiments (i.e. within-task vs cross-task) are implemented and the SVM (support vector machine) algorithm is applied. Experimental results show that our non-instance learning-based OM approach performs well on most of OAEI benchmark tests when training and testing on the same mapping task; and the results of approach vary according to the likelihood of training data and testing data when training and testing on different mapping tasks. Copyright (C) 2010 John Wiley & Sons, Ltd.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available