[1]刘莹,刘国奇,任介夫,等.基于Web服务复杂网络的服务社区构建方法[J].东南大学学报(自然科学版),2013,43(6):1180-1184.[doi:10.3969/j.issn.1001-0505.2013.06.009]
 Liu Ying,Liu Guoqi,Ren Jiefu,et al.Service community construction method based on Web service complex network[J].Journal of Southeast University (Natural Science Edition),2013,43(6):1180-1184.[doi:10.3969/j.issn.1001-0505.2013.06.009]
点击复制

基于Web服务复杂网络的服务社区构建方法()
分享到:

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
43
期数:
2013年第6期
页码:
1180-1184
栏目:
计算机科学与工程
出版日期:
2013-11-20

文章信息/Info

Title:
Service community construction method based on Web service complex network
作者:
刘莹1刘国奇1任介夫1姜琳颖1张斌2
1东北大学软件学院, 沈阳 110819; 2东北大学信息科学与工程学院, 沈阳 110819
Author(s):
Liu Ying1 Liu Guoqi1 Ren Jiefu1 Jiang Linying1 Zhang Bin2
1College of Software, Northeastern University, Shenyang 110819, China
2College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
关键词:
Web服务复杂网络 服务社区 加权GN算法 服务相似度
Keywords:
Web service complex network service community weighted GN algorithm service similarity
分类号:
TP311
DOI:
10.3969/j.issn.1001-0505.2013.06.009
摘要:
针对传统Web服务社区手动注册构建方式效率较低,难以对服务资源进行有效组织和管理的问题,提出了一种基于Web服务复杂网络模型、使用GN算法划分服务社区的方法.该方法基于Web服务之间的语义层次相似关系构建Web服务复杂网络,定义服务输入输出语义信息的相似程度为网络中边的权值.基于Web复杂网络模型划分服务社区时,由于传统自包含GN算法在构建Web服务社区时存在社区规模不合理,社区内服务平均相似度较低、波动大的问题,提出加权边介数和加权强社团的概念,并且算法以网络中所有社区均为加权强社团作为社区分裂的终止条件.实验结果表明,提出的算法与传统自包含GN算法相比,社区规模更加符合实际情况,社区内服务平均相似度更高,稳定性更好,能够有效地构建出Web服务社区.
Abstract:
Aiming at low efficiency in the manual construction of the Web service community and the difficulty in an effective organization and management of service resources, a service community construction method is proposed based on the Web service complex network and the Girvan-Newman(GN)algorithm. This method constructs the Web service complex network based on the semantic similar relations, and the weights of edges are calculated according to the semantic similarities of services inputs and outputs. When using the traditional GN algorithm to divide the service community in the Web service complex network, the community scale is unreasonable and the average similarity of services in the community is low. As a result, the concepts of weighted edge betweenness and weighted strong community are put forward. In the implement of the algorithm, when all the communities are weighted as strong ones, the community splitting process is over. Experimental results show that the community scale, average similarity and fluctuation are greatly improved compared with the traditional GN algorithm, and the improved algorithm can effectively construct the Web service community.

参考文献/References:

[1] Popa V, Constantinescu L, Moise M, et al. Management of Web services communities, WSC system [J]. Studies in Informatics and Control,2010, 19(3):295-308.
[2] Chantal C, Vincent L, Jean-Francois S. Benefits of semantics on Web service composition from a complex network perspective [C]//Proceedings of International Conference on Networked Digital Technologies. Berlin, Germany, 2010:80-90.
[3] Perryea C A. Community-based service discovery[C]//Proceedings of 2006 IEEE International Conference on Web Services. Chicago, IL, USA, 2006:903-906.
[4] Zhang Xizhe, Yin Ying, Zhang Mingwei, et al. Web service community discovery based on spectrum clustering [C]//Proceedings of the 2009 International Conference on Computational Intelligence and Security. Beijing, China, 2009:187-191.
[5] Fortunato S. Community detection in graphs [J]. Physics Reports, 2010,486(3/4/5):75-174.
[6] 朱志良,邱媛源,李丹程,等. 一种Web服务复杂网络的构建方法[J]. 小型微型计算机系统,2012,33(2):199-205.
  Zhu Zhiliang, Qiu Yuanyuan, Li Dancheng, et al. Approach for building complex network of Web service [J]. Journal of Chinese Computer Systems, 2012,33(2):199-205.(in Chinese)
[7] Fan Y, Li M H, Zhang P, et al. Accuracy and precision of methods for community identification in weighted networks [J]. Physica A: Statistical Mechanics and its Applications, 2007, 377(1): 363-372.
[8] 汪小帆,李翔,陈关荣. 复杂网络理论及其应用[M].北京:清华大学出版社,2006:164-169.
[9] Radicchi F, Castellano C, Cecconi F, et al. Defining and identifying communities in networks [J]. Proc Natl Acad Sci, 2004,101(9):2658-2663.
[10] 彭晖,史忠植,邱莉榕,等. 基于本体概念相似度的语义Web服务匹配算法[J]. 计算机工程,2008,34(15):51-53.
  Peng Hui, Shi Zhongzhi, Qiu Lirong, et al. Matching algorithm of semantic Web service based on similarity of ontology concepts [J]. Computer Engineering, 2008,34(15):51-53.(in Chinese)
[11] Newman M E J, Girvan M. Finding and evaluating community structure in networks [J]. Physical Review E, 2004,69(2):026113-01-026113-15.
[12] China Web Service Cup(CWSC2011)[EB/OL].(2011)[2012-10-15].http://debs.ict.ac.cn/cwsc2011/technical_details.html.

备注/Memo

备注/Memo:
作者简介: 刘莹(1981—),女,博士生;张斌(联系人),男,博士,教授,博士生导师,zhangbin@mail.neu.edu.cn.
基金项目: 国家自然科学基金资助项目(61073062,61100027,61202085, 61374178)、辽宁省博士启动基金资助项目(20111001,20121002)、辽宁省自然科学基金资助项目(201202076)、教育部博士点基金资助项目(20120042120010)、中央高校基本科研业务费专项资金资助项目(N110417001,N110417004).
引文格式: 刘莹,刘国奇,任介夫,等.基于Web服务复杂网络的服务社区构建方法[J].东南大学学报:自然科学版,2013,43(6):1180-1184. [doi:10.3969/j.issn.1001-0505.2013.06.009]
更新日期/Last Update: 2013-11-20