A Probabilistic Model for Service Clustering - Jointly Using Service Invocation and Service Characteristics

Service clustering is the foundation of service discovery, recommendation and composition. Most of the existing methods mainly use service attribute information and ignore the semantic-based invocation relationships among service users. In fact, mutual invocation relationships between services occur on operations of the corresponding services, while service attributes are the whole service description. Our main challenge may be to effectively combine these two kinds of data for service clustering. To address this issue, we propose a new probabilistic generative model which contains two closely connected parts, one characterizing operation community memberships by using operation invocation relationships, and the other characterizing service cluster memberships by utilizing service attributes. The correlations between these two parts are characterized by the relationships between operation communities and service clusters. To train this model, we provide a nested expectation-maximization algorithm. Experimental results show its superior performance over the existing methods for service clustering.

[1]  E A Leicht,et al.  Mixture models and exploratory analysis in networks , 2006, Proceedings of the National Academy of Sciences.

[2]  Srinivasan Parthasarathy,et al.  Efficient community detection in large networks using content and links , 2012, WWW.

[3]  Yun Chi,et al.  Combining link and content for community detection: a discriminative approach , 2009, KDD.

[4]  Bo Jiang,et al.  A Semantic-Based Approach to Service Clustering from Service Documents , 2017, 2017 IEEE International Conference on Services Computing (SCC).

[5]  Jafreezal Jaafar,et al.  Fuzzy-based Clustering of Web Services' Quality of Service: A Review , 2014, J. Commun..

[6]  Weixiong Zhang,et al.  Joint Identification of Network Communities and Semantics via Integrative Modeling of Network Topologies and Node Contents , 2017, AAAI.

[7]  Mingdong Tang,et al.  Domain-aware Mashup service clustering based on LDA topic model from multiple data sources , 2017, Inf. Softw. Technol..

[8]  Patricio A. Vela,et al.  A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm , 2012, Expert Syst. Appl..

[9]  William W. Cohen,et al.  Block-LDA: Jointly Modeling Entity-Annotated Text and Entity-Entity Links , 2014, Handbook of Mixed Membership Models and Their Applications.

[10]  Hong Cheng,et al.  A model-based approach to attributed graph clustering , 2012, SIGMOD Conference.

[11]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[12]  Tong Wu,et al.  Generating bipartite networks with a prescribed joint degree distribution , 2017, J. Complex Networks.