The Community for Technology Leaders
2015 IEEE International Conference on Web Services (ICWS) (2015)
New York, NY, USA
June 27, 2015 to July 2, 2015
ISBN: 978-1-4673-7271-8
pp: 257-264
Many popular web service networks are content-rich in terms of heterogeneous types of entities and links, associated with incomplete attributes. Clustering such heterogeneous service networks demands new clustering techniques that can handle two heterogeneity challenges: (1) multiple types of entities co-exist in the same service network with multiple attributes, and (2) links between entities have diverse types and carry different semantics. Existing heterogeneous graph clustering techniques tend to pick initial centroids uniformly at random, specify the number k of clusters in advance, and fix k during the clustering process. In this paper, we propose Service Cluster, a novel heterogeneous service network clustering algorithm with four unique features. First, we incorporate various types of entity, attribute and link information into a unified distance measure. Second, we design a Discrete Steepest Descent method to naturally produce initial k and initial centroids simultaneously. Third, we propose a dynamic learning method to automatically adjust the link weights towards clustering convergence. Fourth, we develop an effective optimization strategy to identify new suitable k and k well-chosen centroids at each clustering iteration. Extensive evaluation on real datasets demonstrates that Service Cluster outperforms existing representative methods in terms of both effectiveness and efficiency.
Clustering algorithms, Heterogeneous networks, Optimization, Web services, Shape, Polynomials, Learning systems

Y. Zhou et al., "Clustering Service Networks with Entity, Attribute, and Link Heterogeneity," 2015 IEEE International Conference on Web Services (ICWS), New York, NY, USA, 2015, pp. 257-264.
82 ms
(Ver 3.3 (11022016))