Continual Word Embedding Based for Matching Lightweight Ontologies

被引:0
作者
Wu Zhenle [1 ]
Ying, Li [1 ]
Wang Yongbin [1 ]
Zang, Yanjiao [1 ]
机构
[1] Commun Univ China, Sch Comp, Beijing, Peoples R China
来源
MECHATRONICS ENGINEERING, COMPUTING AND INFORMATION TECHNOLOGY | 2014年 / 556-562卷
关键词
Ontology; Ontology Matching; Word Embedding; Skip-gram; Similarity Flooding;
D O I
10.4028/www.scientific.net/AMM.556-562.6281
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Ontology matching is the task of finding alignments between two different ontologies. It has become the key point of building knowledge base and integrating heterogeneous data. In this paper, a novel ontology matching approach that is based on continual word embedding is proposed. We describe in details how is skip-gram model adapted to capture the semantic of words to learn the word embedding. After computing the name similarity of concepts, similarity flooding algorithm is used to fix the initial similarity. Experiments on Ontology Alignment Evaluation Initiative (OAEI) benchmark without instances show that the proposed method significantly improves the quality of mappings.
引用
收藏
页码:6281 / 6285
页数:5
相关论文
共 17 条
[11]   Similarity flooding: A versatile graph matching algorithm and its application to schema matching [J].
Melnik, S ;
Garcia-Molina, H ;
Rahm, E .
18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, :117-128
[12]  
Melnik Sergey., 2003, SIGMOD C, P193, DOI DOI 10.1145/872757.872782
[13]  
Mikolov Tomas, 2013, P 26 INT C NEUR INF
[14]  
Mikolov Tomas, 2013, P WORKSH ICLR, DOI DOI 10.48550/ARXIV.1301.3781
[15]  
Morin F., 2005, INT WORKSHOP ARTIFIC, V5, P246
[16]   A survey of approaches to automatic schema matching [J].
Rahm, E ;
Bernstein, PA .
VLDB JOURNAL, 2001, 10 (04) :334-350
[17]  
Wang Z., 2011, P ACM WEBSCI, V11, P1