A novel algorithm for ontology matching

被引:15
作者
Akbari, Ismail [1 ]
Fathian, Mohammad [1 ]
机构
[1] Iran Univ Sci & Technol, Dept Ind Engn, Tehran, Iran
关键词
lexical similarity; ontology matching; Semantic Web; similarity measure; structure similarity;
D O I
10.1177/0165551510361432
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Ontology matching is an essential aspect of the Semantic Web with a goal of finding alignments among the entities of given ontologies. Ontology matching is a necessary step for establishing interoperation and knowledge sharing among Semantic Web applications. In this study we present an algorithm and a tool developed based on this algorithm to find correspondences among entities of input ontologies. The proposed algorithm uses a new lexical similarity measure and also utilizes structural information of ontologies to determine their corresponding entities. The lexical similarity measure generates a bag of words for each entity based on its label and description information. The structural approach creates a grid for each node in the ontologies. The combination of lexical and structural approaches creates the similarity matrix between the source and target ontologies. The proposed algorithm was tested on a well known benchmark and also compared to other algorithms presented in the literature. Our experimental results show the proposed algorithm is effective and outperforms other algorithms.
引用
收藏
页码:324 / 334
页数:11
相关论文
共 32 条
  • [1] AKBARI I, 2009, C INN TECHN INT SYST
  • [2] An empirical comparison of ontology matching techniques
    Alasoud, Ahmed
    Haarslev, Volker
    Shiri, Nematollaah
    [J]. JOURNAL OF INFORMATION SCIENCE, 2009, 35 (04) : 379 - 397
  • [3] A semantic information gathering approach for heterogeneous information sources on WWW
    Arch-int, N
    Sophatsathit, P
    [J]. JOURNAL OF INFORMATION SCIENCE, 2003, 29 (05) : 357 - 374
  • [4] BOCK J, 2008, 7 INT SEM WEB C KARL
  • [5] BOUQUET P, 2004, J WEB SEMANT, V2, P81, DOI DOI 10.1016/J.WEBSEM.2004.07.004
  • [6] Cohen W., 2003, P WORKSH DAT CLEAN O
  • [7] Do H.H., 2001, P VERY LARGE DATA BA, P610
  • [8] Doan A., 2003, VLDB J SPECIAL ISSUE
  • [9] Dong X, 2004, ACM SIGKDD EXPLORATI, V6, P53, DOI DOI 10.1145/1046456.1046463
  • [10] EHRIG M, 2005, K CAP 05, P25