[1] Cao Jiuxin, Qin Yi, Zhang Song, et al. Efficient semantic web service matching using common ontology [J]. Journal of Southeast University (English Edition), 2012, 28 (3): 292-298. [doi:10.3969/j.issn.1003-7985.2012.03.007]

Copy

Efficient semantic web service matching using common ontology()

基于公共本体的高效语义服务发现

Share：

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

Volumn:

28

Issue:

2012 3

Page:

292-298

Research Field:

Computer Science and Engineering

Publishing date:

2012-09-30

Info

Title:

Efficient semantic web service matching using common ontology

基于公共本体的高效语义服务发现

Author(s):

Cao Jiuxin¹;  2;  Qin Yi¹;  2;  Zhang Song³;  Liu Bo¹;  2;  Dong Fang¹;  2

¹School of Computer Science and Engineering, Southeast University, Nanjing 211189, China
²Key Laboratory of Computer Network and Information Integration of Ministry of Education, Southeast University, Nanjing 211189, China

曹玖新¹;  2;  秦屹¹;  2;  张松³;  刘波¹;  2;  东方¹;  2

¹东南大学计算机科学与工程学院, 南京 211189; ²东南大学网络和信息集成教育部重点实验室, 南京 211189; ³南京师范大学, 南京 210042

Keywords:

service discovery;  domain ontology;  semantic web service;  semantic distance

服务发现;  领域本体;  语义web服务;  语义距离

PACS:

TP393.0

DOI:

10.3969/j.issn.1003-7985.2012.03.007

Abstract:

To solve the bottleneck problem in centralized service discovery methods, a novel architecture based on domain ontology for semantic service discovery is proposed. This distributed architecture can adjust the domain partition and allocate system resources automatically. The characteristics of this mechanism are analyzed, including scalability, self-organization and adaptability. In this mechanism, semantic web service discovery is separated into two parts. First, under balance tree topology, registry proxy can rapidly forward requests to the objective registry center, and avoid the bottleneck problem. Secondly, a semantic distance based service matching algorithm is proposed to promote the effect of service searching. The results of simulation experiments show that the proposed mechanism can serve as a scalable solution for semantic web service publication and discovery. And the improved matching algorithm has higher recall and precision than other algorithms.

为解决集中式服务发现结构存在的性能瓶颈问题, 基于领域本体语义信息, 提出一种能自适应地调整领域划分、分配系统资源的分布式web服务发现体系结构, 并分析了该结构的可扩展性、自组织性和自适应性.具体描述了该结构下的语义web服务发现算法的2个阶段:语义注册中心定位和基于输入输出的服务匹配.在注册中心组成的平衡树拓扑结构中, 注册代理能够快速将请求转发至目标注册中心, 避免产生性能瓶颈.然后, 通过引入一种新的基于语义距离的服务匹配算法来进行服务查询效果优化.模拟实验结果表明:提出的服务发现方法具有高可扩展性的优点;与其他服务查询算法相比, 服务匹配算法具有更高的查全率和查准率.

References:

[1] Sycara K, Paolucci M, Ankolekar A, et al. Automated discovery, interaction and composition of semantic web services[J]. Journal of Web Semantics, 2003, 1(1): 27-46.
[2] Christensen E, Curbera F, Meredith G, et al. Web services description language(WSDL)1.1 [EB/OL].(2001-03-15)[2011-08-30]. http://www.W3.org./TR/wsdl.
[3] Clement L, Hately A, Riegen C, et al. UDDI version 3.0.2 [EB/OL].(2004-10-19)[2011-10-20].http://www.uddi.org/pubs/uddi_v3.htm.
[4] Srinivasan N, Paolucci M, Sycara K. An efficient algorithm for OWL-S based semantic search in UDDI [C]//International Workshop on Semantic Web Services and Web Process Composition. San Diego, USA, 2004: 96-110.
[5] Nan B, Li S, Yang S. The study of distributed semantic web services’ publishing and discovery mechanism [C]//International Conference on Communications and Intelligence Information Security. Ganzhou, China, 2010: 51-54.
[6] Burstein M, Bussler C, Finin T, et al. A semantic web services architecture[J]. Internet Computing, 2005, 9(5): 72-81.
[7] Martin D, Burstein M, McDermott D, et al. Bringing semantics to web services with OWL-S [J]. Journal of World Wide Web, 2007, 10(3): 243-277.
[8] Paolucci M, Kawmura T, Payne T, et al. Semantic matching of web services capabilities [C]//The International Semantic Web Conference. Seattle, USA, 2002: 333-347.
[9] Fu Pengbin, Liu Shanshan, Yang Huirong, et al. Matching algorithm of web services based on semantic distance [C]// International Workshop on Information Security and Application. Qingdao, China, 2009: 465-468.
[10] Klusch M, Fries B, Sycara K. Automated semantic web service discovery with OWLS-MX [C]//Proceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems. Hakodate, Japan, 2006: 915-922.
[11] He Qiang, Yan Jun, Yang Yun, et al. Chord4S: a P2P-based decentralised service discovery approach [C]//IEEE International Conference on Services Computing. Honolulu, HI, USA, 2008: 221-229.
[12] Yao Y, Cao J X. Scalable mechanism for semantic web service registry and discovery [J]. Journal of Southeast University: Natural Science Edition, 2010, 40(2): 264-269.(in Chinese)
[13] Ge J, Qiu Y. Concept similarity matching based on semantic distance [C]//International Conference on Semantics, Knowledge and Grid. Beijing, China, 2008: 380-383.

Memo

Memo:

Biography: Cao Jiuxin(1967—), male, doctor, professor, jx.cao@seu.edu.cn.
Foundation items: The National Basic Research Program of China(973 Program)(No.2010CB328104, 2009CB320501), the National Natural Science Foundation of China(No.61070161, 61070158, 61003257, 61003311), the National Key Technology R& D Program during the 11th Five-Year Plan Period(No.2010BAI88B03), the Foundation of Jiangsu Provincial Key Laboratory of Network and Information Security(No.BM2003201), Open Research Fund from Key Laboratory of Computer Network and Information Integration of Ministry of Education(Southeast University).
Citation: Cao Jiuxin, Qin Yi, Zhang Song, et al. Efficient semantic web service matching using common ontology[J].Journal of Southeast University(English Edition), 2012, 28(3):292-298.[doi:10.3969/j.issn.1003-7985.2012.03.007]

Common functions