Abstract
Structural graph clustering is an important problem in the domain of graph data management. Given a large graph G, structural graph clustering is to assign vertices to clusters where vertices in the same cluster are densely connected to each other and vertices in different clusters are loosely connected to each other. Due to its importance, many algorithms have been proposed to study this problem. However, no effort focuses on the distributed graph environment. In this paper, we propose a parallel computing framework named SGP (short for Statistics-based Graph Partition) to support large graph clustering under distributed environment. We first use historical clustering information to partition graph into a group of clusters. Based on the partition result, we can properly assign vertexes to different nodes based on connection relationship among vertex. When a clustering request is submitted, we can use properties leading by the partition for efficiently clustering. Finally, we conduct extensive performance studies on large real and synthetic graphs, which demonstrate that our new approach could efficiently support large graph clustering under distributed environment.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Xu, X., Yuruk, N., Feng, Z., et al.: SCAN: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, 12–15 August 2007, pp. 824–833. ACM, New York (2007)
Chang, L., Yu, J.X., Qin, L., Lin, X., Liu, C., Liang, W.: Efficiently computing k-edge connected components via graph decomposition. In: Proceedings of SIGMOD 2013 (2013)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70, 066111 (2004)
Huang, X., Cheng, H., Qin, L., Tian, W., Yu, J.X.: Querying k-truss community in large and dynamic graphs. In: Proceedings of SIGMOD 2014 (2014)
Shiokawa, H., Fujiwara, Y., Onizuka, M.: SCAN++: efficient algorithm for finding clusters, hubs and outliers on large-scale graphs. PVLDB 8(11), 1178–1189 (2015)
Wang, L., Xiao, Y., Shao, B., Wang, H.: How to partition a billion server graph. In: Proceedings of ICDE 2014 (2014)
Zhao, W., Martha, V.S., Xu, X.: PSCAN: a parallel structural clustering algorithm for big networks in MapReduce. In: Proceedings of the 27th IEEE International Conference on Advanced Information Networking and Applications, Barcelona, 25–28 March 2013, pp. 862–869. IEEE Computer Society, Washington (2013)
Ding, C.H.Q., He, X., Zha, H., Gu, M., Simon, H.D.: A min-max cut algorithm for graph partitioning and data clustering. In: Proceedings of ICDM 2001 (2001)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888–905 (2000)
Holme, P., Kim, B.J.: Growing scale-free networks with tunable clustering. Phys. Rev. E 65(2), 026107 (2002)
Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)
Zhang, Y., Parthasarathy, S.: Extracting analyzing and visualizing triangle k-core motifs within networks. In: Proceedings of ICDE 2012 (2012)
Xin, R.S., Gonzalez, J.E., Franklin, M.J., et al.: GraphX: a resilient distributed graph system on Spark. In: Proceedings of the 1st International Workshop on Graph Data Management Experiences and Systems, New York, 23 June 2013, vol. 2. ACM, New York (2013)
Wang, T., Yucheng, L., Wang, J., Dai, H.-N., Zheng, X., Jia, W.: EIHDP: edge-intelligent hierarchical dynamic pricing based on cloud-edge-client collaboration for IoT systems. IEEE Trans. Comput. 70(8), 1285–1298 (2021)
Wang, T., Liu, Y., Zheng, X., Dai, H.-N., Jia, W., Xie, M.: Edge-based communication optimization for distributed federated learning. IEEE Trans. Netw. Sci. Eng. (2021). https://doi.org/10.1109/TNSE.2021.3083263
Youke, W., Huang, H., Ningyun, W., Wang, Y., Bhuiyan, Md.Z.A., Wang, T.: An incentive-based protection and recovery strategy for secure big data in social networks. Inf. Sci. 508, 79–91 (2020)
Acknowledgment
This paper is partly supported by the National Natural Science Foundation for Young Scientists of China (61702344, 61701322), the Natural Science Foundation of Liaoning Province under Grant No. 2019-ZD-0224.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Xia, X., Fang, P., An, Y., Zhu, R., Zong, C. (2022). SGP: A Parallel Computing Framework for Supporting Distributed Structural Graph Clustering. In: Lai, Y., Wang, T., Jiang, M., Xu, G., Liang, W., Castiglione, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2021. Lecture Notes in Computer Science(), vol 13157. Springer, Cham. https://doi.org/10.1007/978-3-030-95391-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-030-95391-1_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-95390-4
Online ISBN: 978-3-030-95391-1
eBook Packages: Computer ScienceComputer Science (R0)