Abstract
Early fusion methods are a category of community detection methods for attributed networks that merge attributes and structure before the method is executed. Typically, a weighted network where the edge between two nodes includes both the structure information (i.e. the weight of the existing link) and the similarity of the attributes is obtained and then, classical community detection algorithms can be applied. In this paper, we investigate the role of kernels on a method based on a Genetic Algoritm (GA). When measuring similarity, kernels are able to provide a more suitable and meaningful form for the similarity matrix in order to facilitate data analysis. Through simulations on both synthetic and real-world attributed networks, we first apply different kernels to @NetGA, a genetic algorithm we proposed for attributed networks which embeds into edges both the structure and the attribute information through a unified distance measure. We compare this novel approach named K@NetGA to @NetGA showing that the Free-Energy kernel is able to sensibly improve the community detection performance. We finally compare our method to other kernel-based community detection methods on a wider set of networks finding that K@NetGA is the best-performing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Both datasets are available at https://linqs.soe.ucsc.edu/.
References
Avrachenkov, K., Chebotarev, P., Rubanov, D.: Kernels on graphs as proximity measures. In: Bonato, A., Chung Graham, F., Prałat, P. (eds.) WAW 2017. LNCS, vol. 10519, pp. 27–41. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67810-8_3
Aynulin, R.: Efficiency of transformations of proximity measures for graph clustering. In: Avrachenkov, K., Prałat, P., Ye, N. (eds.) WAW 2019. LNCS, vol. 11631, pp. 16–29. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25070-6_2
Aynulin, R.: Impact of network topology on efficiency of proximity measures for community detection. In: Cherifi, H., Gaito, S., Mendes, J.F., Moro, E., Rocha, L.M. (eds.) COMPLEX NETWORKS 2019. SCI, vol. 881, pp. 188–197. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-36687-2_16
Aynulin, R., Chebotarev, P.: Measuring proximity in attributed networks for community detection. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) Complex Networks & Their Applications IX. COMPLEX NETWORKS 2020 2020. Studies in Computational Intelligence, vol. 943, pp. 27–37. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-65347-7_3
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefevre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. P10008 (2008)
Bothorel, C., Cruz, J.D., Magnani, M., Micenkova, B.: Clustering attributed graphs: models, measures and methods. Netw. Sci. 3(3), 408–444 (2015)
Chunaev, P.: Community detection in node-attributed social networks: a survey. Comput. Sci. Rev. 37, 100286 (2020)
Combe, D., Largeron, C., Egyed-Zsigmond, E., Géry, M.: Combining relations and text in scientific network clustering. In: 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1248–1253. IEEE (2012)
Elhadi, H., Agam, G.: Structure and attributes community detection: comparative analysis of composite, ensemble and selection methods. In: Proceedings of the 7th Workshop on Social Network Mining and Analysis, pp. 1–7 (2013)
Hartigan, J.A., Wong, M.A.: Algorithm as 136: a k-means clustering algorithm. J. R. Stat. Soc. Ser. C (Appl. Stat.) 28(1), 100–108 (1979)
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Phys. Rev. E 78(4), 046110 (2008)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)
Papadopoulos, A., Pallis, G., Dikaiakos, M.D.: Weighted clustering of attributed multi-graphs. Computing 99(9), 813–840 (2017)
Park, Y., Song, M.: A genetic algorithm for clustering problems. In: Proceedings of the Third Annual Conference on Genetic Programming, vol. 1998, pp. 568–575 (1998)
Pizzuti, C., Socievole, A.: A genetic algorithm for community detection in attributed graphs. In: Sim, K., Kaufmann, P. (eds.) EvoApplications 2018. LNCS, vol. 10784, pp. 159–170. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-77538-8_12
Pizzuti, C., Socievole, A.: Multiobjective optimization and local merge for clustering attributed graphs. IEEE Trans. Cybern. 50(12), 4997–5009 (2019)
Sommer, F., Fouss, F., Saerens, M.: Comparison of graph node distances on clustering tasks. In: Villa, A.E.P., Masulli, P., Pons Rivero, A.J. (eds.) ICANN 2016. LNCS, vol. 9886, pp. 192–201. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44778-0_23
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Socievole, A., Pizzuti, C. (2023). Kernel-based Early Fusion of Structure and Attribute Information for Detecting Communities in Attributed Networks. In: De Stefano, C., Fontanella, F., Vanneschi, L. (eds) Artificial Life and Evolutionary Computation. WIVACE 2022. Communications in Computer and Information Science, vol 1780. Springer, Cham. https://doi.org/10.1007/978-3-031-31183-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-31183-3_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-31182-6
Online ISBN: 978-3-031-31183-3
eBook Packages: Computer ScienceComputer Science (R0)