Discovering Important Services Based on Weighted K-Core Decomposition

Withthedevelopmentofservice-orientedarchitecture,thenumberofservicesisexpandingrapidly. Importantservicesusuallyhavehighquality,andtheycanberecommendedtousersiftheusersdo notgiveanykeyword.However,howtodiscovertheimportantservicesisstillaproblemfacingmany people.Inthisarticle,theauthorsproposeanovelapproachtodiscoverimportantservicesbasedon servicenetworks.First,theirapproachusesservicenetworkstoabstractservicesandtherelations betweenthem.Second,theauthorsemploytheweightedk-coredecompositionapproachinthefieldof complexnetworkstopartitiontheservicenetworkintoalayeredstructureandcalculatetheweighted corenessvalueofeachservicenode.Finally,serviceswillberankedaccordingtotheirweighted corenessvaluesinadescendingorder.Thetop-rankedservicesaretheimportantonestheauthors’ approachrecommends.Experimentalresultsonareal-worlddatasetcrawledfromProgrammableWeb validatetheeffectivenessoftheirapproach. KeyWoRDS Complex Network, K-Core Decomposition, Service Computing, Service Importance, Service Network

[1]  Jing Liu,et al.  Analyzing the structure of Java software systems by weighted K-core decomposition , 2017, Future Gener. Comput. Syst..

[2]  Weifeng Pan,et al.  Structure-aware Mashup service Clustering for cloud-based Internet of Things using genetic algorithm based clustering algorithm , 2018, Future Gener. Comput. Syst..

[3]  Elmar Jürgens,et al.  Using Network Analysis for Recommendation of Central Software Classes , 2012, 2012 19th Working Conference on Reverse Engineering.

[4]  Jia Zhang,et al.  Service Oriented Solution Modeling and Variation Propagation Analysis Based on Architectural Building Blocks , 2013, Int. J. Web Serv. Res..

[5]  M. Kendall.  A NEW MEASURE OF RANK CORRELATION , 1938 .

[6]  Soundar R. T. Kumara,et al.  Effective Web Service Composition in Diverse and Large-Scale Service Networks , 2008, IEEE Transactions on Services Computing.

[7]  Stephen P. Borgatti,et al.  Centrality and network flow , 2005, Soc. Networks.

[8]  Andy Zaidman,et al.  Automatic identification of key classes in a software system using webmining techniques , 2008 .

[9]  Yinglin Wang,et al.  Service ranking in service networks using parameters in complex networks: a comparative study , 2019, Cluster Computing.

[10]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[11]  Michele Benzi,et al.  On the Limiting Behavior of Parameter-Dependent Network Centrality Measures , 2013, SIAM J. Matrix Anal. Appl..

[12]  Pan Wei.  Service Classification and Recommendation Based on Software Networks , 2011 .

[13]  Xu Fen.  A Software Network-based Important Service Discovery Method , 2015 .

[14]  Dimitris Sacharidis,et al.  Ranking and Clustering Web Services Using Multicriteria Dominance Relationships , 2010, IEEE Transactions on Services Computing.

[15]  Frank Schweitzer,et al.  A k-shell decomposition method for weighted networks , 2012, ArXiv.

[16]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[17]  Kangshun Li,et al.  Identifying key classes in object-oriented software using generalized k-core decomposition , 2018, Future Gener. Comput. Syst..

[18]  Michele Benzi,et al.  A matrix analysis of different centrality measures , 2013, ArXiv.

[19]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[20]  Bing Li,et al.  Service Classification and Recommendation Based on Software Networks: Service Classification and Recommendation Based on Software Networks , 2012 .