Computer Science ›› 2018, Vol. 45 ›› Issue (3): 204-212.doi: 10.11896/j.issn.1002-137X.2018.03.032

Previous Articles     Next Articles

Service Clustering Approach for Global Social Service Network

LU Jia-wei, MA Jun, ZHANG Yuan-ming and XIAO Gang   

  • Online:2018-03-15 Published:2018-11-13

Abstract: The existing service clustering approaches mainly focus on functionality or QoS attribute,and they are lack of considering the social attribute in services.The growing number of Web services brings about a series problems of reducing efficiency of service discovery.Thus,this paper proposed a new service clustering approach for global social ser-vice network which can connect the isolated service into a social network.First,the similarity of services is calculated according to descriptive information,tag of domain area and QoS attribute in REST and SOAP service.Second,similarity calculations are clustered by combining with social attribute to enhance the services’ sociability on a global scale.At last,service visualization of global social service network is given to show the social relationships among realted servi-ces.The experimental result shows the effectiveness of the proposed method.

Key words: Service clustering,Global social service network,Service discovery,Service visualization

[1] AL-MASRI E,MAHMOUD Q H.Investigating Web Serviceson the World Wide Web[C]∥International Conference on World Wide Web(WWW 2008).Beijing,China,2008:795-804.
[2] CHEN W,PAIK I,HUNG P C K.Constructing a Global Social Service Network for Better Quality of Web Service Discovery[J].IEEE Transactions on Services Computing,2015,8(2):284-298.
[3] LI Z,WANG J,ZHANG N,et al.A Topic-Oriented Clustering Approach for Domain Services[J].Journal of Computer Research and Development,2014,1(2):408-419.(in Chinese) 李征,王健,张能,等.一种面向主题的领域服务聚类方法[J].计算机研究与发展,2014,51(2):408-419.
[4] TIAN G,HE K Q,WANG J,et al.Domain-Oriented and Tag-Aided Web Service Clustering Method[J].Acta Electronica Sinica,2015,3(7):1266-1274.(in Chinese) 田刚,何克清,王健,等.面向领域标签辅助的服务聚类方法[J].电子学报,2015,43(7):1266-1274.
[5] LIU W,WONG W.Web service clustering using text miningtechniques[J].International Journal of Agent-Oriented Software Engineering,2009,3(1):6-26.
[6] CHERIFI C,LABATUT V.Web Services Dependency Net-works Analysis[C]∥International Conference on New Media and Interactivity.2010:115-120.
[7] GUO F,WEI G,DENG M M,et al.Service Oriented Petri Net Model and It’s Structural Operational Semantics[J].Journal of Chinese Computer Systems,2013,4(12):2739-2743.(in Chinese) 郭峰,魏光,邓蒙蒙.一种面向服务Petri网模型及其结构化操作语义[J].小型微型计算机系统,2013,34(12):2739-2743.
[8] WANG X,WANG Z,XU X.Semi-empirical Service Composition:A Clustering Based Approach[C]∥IEEE International Conference on Web Services(ICWS 2011).Washington DC,USA,DBLP,2011:219-226.
[9] CHEN L,WANG Y,YU Q,et al.WT-LDA:User TaggingAugmented LDA for Web Service Clustering[M]∥ Service-Orien-ted Computing.2013:162-176.
[10] KUMARA B T,PAIK I,KOSWATTE K R.Ontology learning with complex data type for Web service clustering[C]∥IEEE Symposium on Computational Intelligence and Data Mining (CIDM).IEEE,2014:129-136.
[11] NAYAK R,LEE B.Web Service Discovery with additional Semantics and Clustering[C]∥IEEE/WIC/ACM International Conference on Web Intelligence.IEEE,2007:555-558.
[12] WU J,CHEN L,ZHENG Z,et al.Clustering Web services to facilitate service discovery[J].Knowledge & Information Systems,2014,38(1):207-229.
[13] XIE L L,CHEN F Z,KOU J S.Ontology-based semantic web services clustering[C]∥2011 IEEE 18Th International Confe-rence on Industrial Engineering and Engineering Management (IE&EM).IEEE,2011:2075-2079.
[14] KUMARA B T G S,YAGUCHI Y,PAIK I,et al.Clustering and Spherical Visualization of Web Services[C]∥IEEE International Conference on Services Computing.IEEE Computer Socie-ty,2013:89-96.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .