Ontology mapping: as a binary classification problem

被引:17
|
作者
Mao, Ming [1 ]
Peng, Yefei [2 ]
Spring, Michael [3 ]
机构
[1] SAP Labs, Palo Alto, CA 94306 USA
[2] Yahoo Labs, Santa Clara, CA 95054 USA
[3] Univ Pittsburgh, Sch Informat Sci, Pittsburgh, PA 15260 USA
来源
关键词
ontology mapping; binary classification; machine learning; Semantic Web; SEMANTIC-INTEGRATION;
D O I
10.1002/cpe.1633
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:1010 / 1025
页数:16
相关论文
共 50 条