RMP: An element-level and graph-level combined ontology matching framework

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ontology offers rich properties to describe knowledge in information systems. However, ontologies in knowledge-based systems usually suffer from semantic heterogeneities due to distributed developers. Ontology matching is a key solution to the heterogeneity problem in knowledge management. Though state-of-the-art ontology matching systems are able to support diverse ontology matching tasks, the semantic heterogeneity in ontology matching is still the main challenge. In this paper, we propose an element and graph combined matching framework to specifically deal with semantic heterogeneity during ontology matching. Moreover, we also develop an automated ontology matching system and evaluate the system in diverse ontology matching tasks. By using the graph indexing technique, the matching system is scalable with large ontology matching. The experimental results show that the proposed system achieves a good result in highly heterogeneous matching tasks and a comparable result in large ontology matching tasks.

Cite

CITATION STYLE

APA

Zhang, Y., Xie, C., Zhong, H., Jiang, L., & Cai, H. (2016). RMP: An element-level and graph-level combined ontology matching framework. In Communications in Computer and Information Science (Vol. 675, pp. 195–210). Springer Verlag. https://doi.org/10.1007/978-981-10-3482-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free