Criteria-Based Approximate Matching of Large-Scale Ontologies

被引:0
作者
Liang, Shuai [1 ,2 ]
Luo, Qiangyi [3 ]
Xu, Guangfei [2 ]
Huang, Wenhua [1 ]
Zhang, Yi [1 ]
机构
[1] PLA Univ Sci & Technol, Inst Command Automat, Nanjing 210007, Jiangsu, Peoples R China
[2] The 63892nd unit PLA, Luoyang, Peoples R China
[3] Inst Elect Equipment Syst Engn Corp, Beijing, Peoples R China
来源
KNOWLEDGE ENGINEERING AND MANAGEMENT | 2011年 / 123卷
关键词
ontology matching; ontology modularization; approximate ontology matching; combinatorial optimization;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Large ontology matching problem brings a new challenge to the state of ontology matching technology. In this paper we present a criteria-Based approximate matching approach to solve the problem. The main principle of our approach is based on fully explore semantic information hidden in ontology structures, either physically or logically, and tightly coupled element-level and structure-level features to obtain matching results. Through joining the quantitative structural information for the matching process can significantly decrease the execution time with pretty good quality.
引用
收藏
页码:283 / +
页数:2
相关论文
共 6 条
[1]  
[Anonymous], 1993, P 2 INT C INF KNOWL
[2]   Gene Ontology: tool for the unification of biology [J].
Ashburner, M ;
Ball, CA ;
Blake, JA ;
Botstein, D ;
Butler, H ;
Cherry, JM ;
Davis, AP ;
Dolinski, K ;
Dwight, SS ;
Eppig, JT ;
Harris, MA ;
Hill, DP ;
Issel-Tarver, L ;
Kasarskis, A ;
Lewis, S ;
Matese, JC ;
Richardson, JE ;
Ringwald, M ;
Rubin, GM ;
Sherlock, G .
NATURE GENETICS, 2000, 25 (01) :25-29
[3]   Matching large ontologies: A divide-and-conquer approach [J].
Hu, Wei ;
Qu, Yuzhong ;
Cheng, Gong .
DATA & KNOWLEDGE ENGINEERING, 2008, 67 (01) :140-160
[4]   The structure and function of complex networks [J].
Newman, MEJ .
SIAM REVIEW, 2003, 45 (02) :167-256
[5]  
PERONI S, 2008, LECT NOTES COMPUTER, V5367, P242, DOI DOI 10.1007/978-3-540-89704-0_17
[6]  
Zaslavskiy M., 2008, CORR