|Table of Contents|

[1] Liu Chen, Han Yanbo, Chen Wanghu, et al. More efficient ontology matching algorithmfor integrating heterogeneous web resources [J]. Journal of Southeast University (English Edition), 2007, 23 (3): 381-384. [doi:10.3969/j.issn.1003-7985.2007.03.015]
Copy

More efficient ontology matching algorithmfor integrating heterogeneous web resources()
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
23
Issue:
2007 3
Page:
381-384
Research Field:
Computer Science and Engineering
Publishing date:
2007-09-30

Info

Title:
More efficient ontology matching algorithmfor integrating heterogeneous web resources
Author(s):
Liu Chen1 2 Han Yanbo1 Chen Wanghu1 2 Ding Weilong3
1Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080, China
2Graduate University, Chinese Academy of Sciences, Beijing 100039, China
3College of Information Science and Technology, Shando
Keywords:
ontology matching matching performance matching rule
PACS:
TP311
DOI:
10.3969/j.issn.1003-7985.2007.03.015
Abstract:
To improve the performance of the ontology matching process, a more efficient ontology matching algorithm, which can effectively eliminate unnecessary operations of matching entities, is proposed.By the theoretical analysis and proof, a set of matching rules are summarized for depicting inherent relations among matching results of entities.Based on these rules, the proposed algorithm can reuse the matching results of two entities to directly determine the matching results of their adjacent entities.Thereby, redundant operations of matching adjacent entities can be avoided, which can improve the performance of the whole matching process.The experimental results show that, compared with related algorithms, the proposed algorithm has high matching accuracy and can remarkably reduce the consuming time of the whole matching process.So, the proposed algorithm is more competent for the large-scale ontology matching which often occurs in the practical heterogeneous web resources integration project.

References:

[1] Kalfoglou Y, Hu B, Reynolds D, et al.Capturing, representing and operationalising semantic integration(CROSI)project-final report [R].Department of Electronics and Computer Science of University of Southampton, 2005.
[2] Bouquet P, Magnini B, Serafini L, et al.A SAT-based algorithm for context matching [C]//Proc of the 4th International and Interdisciplinary Conference on Modeling and Using Context.Springer-Verlag, 2003:66-79.
[3] Castano S, Ferrara A, Montanelli S.Matching ontologies in open networked systems:techniques and applications [J].Journal of Data Semantics, 2006, 5:25-63.
[4] Giunchiglia F, Shvaiko P, Yatskevich M.S-match:an algorithm and an implementation of semantic matching [C]//Proc of the European Semantic Web Symposium.Springer-Verlag, 2004:61-75.
[5] Euzenat J, Valtchev P.Similarity-based ontology alignment in owl-lite [C]//Proc of the European Conference on Artificial Intelligence. Amsterdam:IOS Press, 2004:333-337.
[6] Ehrig M, Sure Y.FOAM—framework for ontology alignment and mapping;results of the ontology alignment initiative [C]//Proc of the Workshop on Integrating Ontologies.Banff, Alberta, Canada, 2005:72-76.
[7] Miller A G.WordNet:a lexical database for English [J].Communications of the ACM, 1995, 38(11):39-41.
[8] Euzenat J.An Api for ontology alignment [C]//Proc of the International Semantic Web Conference.Springer-Verlag, 2004:698-712.
[9] Shvaiko P, Euzenat J.A survey of schema-based matching approaches [J].Journal of Data Semantics, 2005, 4:146-171.
[10] Beckett D, McBride B.Rdf/xml syntax specification(revised)world wide web consortium [EB/OL].(2004-02-10)[2007-05-10].http://www.w3.org/tr/rdf-syntax-grammar/.
[11] Brickley D, Guha R V.Rdf vocabulary description language 1.0:Rdf schema.World wide web consortium [EB/OL].(2004-02-10)[2007-05-10].http://www.w3.org/tr/rdf-schema/.

Memo

Memo:
Biographies: Liu Chen(1980—), male, graduate;Han Yanbo(corresponding author), male, doctor, professor, yhan@ict.ac.cn.
Last Update: 2007-09-20