Research of Composite Ontology Mapping Strategy on the Parsing Graph

Shi Yong Ling; Jin Hong Gong

doi:10.4028/www.scientific.net/AMR.765-767.1068

Paper Titles

A Solution for Anonymous Routers Discovery Based on Source-Routing Traceroute
p.1050

Study on Improved Flexible Neural Tree Optimization Algorithm
p.1055

Research and Practice of Application-Level Maintenance Platform Based on ITIL
p.1060

Anti-Missile Network Edge Importance Research
p.1064

Research of Composite Ontology Mapping Strategy on the Parsing Graph
p.1068

Implementation of a Double Sequence Encryption Scheme Based on Chaotic Map
p.1073

Improvements on the Cairngorm Framework of the Service Invocation Mechanism
p.1077

Study on Meta-Data of Network Information Resources
p.1082

Research and Design of the Distributed Mass Small File Storage System Based on WCF
p.1087

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 765-767Research of Composite Ontology Mapping Strategy on...

Research of Composite Ontology Mapping Strategy on the Parsing Graph

Abstract:

According to complex context relation of ontology, considering different input schema, ontology graph is created with general environment. Based on ontology structure, the paper constructs multiple level graph representation, By introducing similarity propagation of structural and instance level on context relation and rapid mapping with a rapid matching algorithm, a composite ontology mapping strategy is proposed, which iteratively achieves ontology mapping result with reused idea. Finally feasibility and effectiveness of the strategy is proved by complexity analysis to algorithm and some contrast test.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

1068-1072

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.765-767.1068

Citation:

Cite this paper

Online since:

September 2013

Authors:

Shi Yong Ling, Jin Hong Gong

Keywords:

Composite Ontology Mapping, Parse Ontology Graph, Rapid Matching Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Ehrig M,S. Staab, QOM: Quick ontology mapping [J], in Proceedings of ISWC, 2004, pp.683-697.

DOI: 10.1007/978-3-540-30475-3_47

Google Scholar

[2] Yves R. Jean-Maryl，Mansur R. Kabuka. ASMOV Results for OAEI 2007. 141-151.

Google Scholar

[3] JieT, BangyongL, ZijuanLi, Ontology Automatic Mapping in Semantic Web[J], Computer Journal, 2006. 11，Vol 29, 1956-(1976).

Google Scholar

[4] D. Englllann，S. Massmann，Instance Matching with COMA++. BTW2007 Workshop: Model Management and Metadaten-Verwaltung [J]. (2007).

Google Scholar

[5] Giunchiglia F, Shvaiko P, Yatskevich M, S-Matching: an algorithm and an implementation of semantic matching [J], in Proceeding of ESWS. 2004. 61-75.

DOI: 10.1007/978-3-540-25956-5_5

Google Scholar

[6] Dong, X.; Halevy, A.; Madhavan, J.: Reference Reconciliation in Complex Information Spaces. In Proc. of the 2005 ACM SIGMOD Int. Conference on Management of Data. ACM Press, New York, NY, USA, 2005; pp.85-96.

DOI: 10.1145/1066157.1066168

Google Scholar

[7] Muhlenbein H, Mahnig T. Convergence theory and application of the factorized distribution algorithm. Journal of Computing and Information Technology [J], 1999, 7(1): 19-32.

Google Scholar

[8] XiL, DezhiX, JianxinW. Improved Algorithm of Structure Strategy in Ontology Mapping, Computer Engineer and Application. 2010, 46(26).

Google Scholar

[9] H.H. Do, Rahm E, COMA- a system for flexible combination of schema matching approaches [J], in Proceedings of VLDB 2001. 610-621.

DOI: 10.1016/b978-155860869-6/50060-3

Google Scholar

[10] Gusfield D, Irving R W. The stable marriage problem: structure and algorithms [J]. MIT Press Cambridge, MA, USA, (1989).

Google Scholar

[11] Lovasz L. Matching Theory. Elsevier Science Ltd, (1986).

Google Scholar

[12] Blum N. A Simplified Realization of the Hopocroft Karp Approach to Maximum Matching [J] in Genenal Graphs. Inst. fur Infromatik on Computing 1999, 2(4): 225-231.

Google Scholar