Abstract
Community clustering means the vertices in networks are often used to cluster into tightly-knit group with a high density of within-group edges and a lower density of between-group edges. However, most community clustering algorithms do not involve the node attributes and relationship, and these approaches lead to inaccuracy clustering. In this paper, we propose two algorithms which involve both node attributes and link structure in social networks based on Girvan-Newman algorithm (GN) and Weighted Informative Graph (WIG). The related experimental results verify the effectiveness of our proposed algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49(2):291–307
Newman MEJ (2004) Fast Algorithm for detecting community structure in networks. Phys Rev E 69:066133
Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large network. Phys Rev E 70(6):066111
Pascal P, Matthieu L (2006) Computing communities in large networks using random walks. J Graph Algorithms Appl 10(2):191–218
Xu X, Yuruk N, Feng Z et al (2007) SCAN: a structural clustering algorithm for networks. KDD 2007, pp 824–833
Dang TA, Viennet E (2012) Community detection based on structural and attribute similarities. 978-1-61208-176
Girvan M, Newman MEJ (2002) Community structure in social and biological networks. PNAS 99(12):7821–7826
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Xu, Y., Gao, Y., Li, W. (2016). Community Clustering Based on Weighted Informative Graph. In: Hung, J., Yen, N., Li, KC. (eds) Frontier Computing. Lecture Notes in Electrical Engineering, vol 375. Springer, Singapore. https://doi.org/10.1007/978-981-10-0539-8_22
Download citation
DOI: https://doi.org/10.1007/978-981-10-0539-8_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0538-1
Online ISBN: 978-981-10-0539-8
eBook Packages: Computer ScienceComputer Science (R0)