Skip to main content

2024 | OriginalPaper | Buchkapitel

Hierarchical Overlapping Community Detection for Weighted Networks

verfasst von : Petr Prokop, Pavla Dráždilová, Jan Platoš

Erschienen in: Complex Networks & Their Applications XII

Verlag: Springer Nature Switzerland

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Real-world networks often contain community structures, where nodes form tightly interconnected clusters. Recent research indicates hierarchical organization, where vertices split into groups that further subdivide across multiple scales. However, individuals in social networks typically belong to multiple communities due to their various affiliations, such as family, friends, and colleagues. These overlaps will emerge in the community structure of online social networks and other complex networks like in biology, where nodes have diverse functions. In this work, we propose an algorithm for hierarchical overlapping community detection in weighted networks. The overlap between clusters is realized via maximal cliques that are used as base elements for hierarchical agglomerative clustering on the graph (GHAC). The closed trail distance and the size of the maximal clique in overlap are used for the dissimilarity between clusters in agglomerative steps of the GHAC. The closed trail distance is designed for weighted networks.
Experiments on synthetic networks and different evaluations of the results of experiments show that the proposed algorithm is comparable with other widely used algorithms for overlapping community detection and is efficient for detecting hierarchy structure in weighted networks.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Adamcsek, B., Palla, G., Farkas, I.J., Derényi, I., Vicsek, T.: CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22(8), 1021–1023 (2006)CrossRef Adamcsek, B., Palla, G., Farkas, I.J., Derényi, I., Vicsek, T.: CFinder: locating cliques and overlapping modules in biological networks. Bioinformatics 22(8), 1021–1023 (2006)CrossRef
2.
Zurück zum Zitat Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010) Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761–764 (2010)
3.
Zurück zum Zitat Altaf-Ul-Amin, M., Shinbo, Y., Mihara, K., Kurokawa, K., Kanaya, S.: Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinform. 7, 1–13 (2006)CrossRef Altaf-Ul-Amin, M., Shinbo, Y., Mihara, K., Kurokawa, K., Kanaya, S.: Development and implementation of an algorithm for detection of protein complexes in large interaction networks. BMC Bioinform. 7, 1–13 (2006)CrossRef
4.
Zurück zum Zitat Berahmand, K., Bouyer, A., Vasighi, M.: Community detection in complex networks by detecting and expanding core nodes through extended local similarity of nodes. IEEE Trans. Comput. Soc. Syst. 5(4), 1021–1033 (2018)CrossRef Berahmand, K., Bouyer, A., Vasighi, M.: Community detection in complex networks by detecting and expanding core nodes through extended local similarity of nodes. IEEE Trans. Comput. Soc. Syst. 5(4), 1021–1033 (2018)CrossRef
5.
Zurück zum Zitat Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008) Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)
6.
Zurück zum Zitat Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)CrossRef Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)CrossRef
7.
Zurück zum Zitat Brzozowski, Ł., Siudem, G., Gagolewski, M.: Community detection in complex networks via node similarity, graph representation learning, and hierarchical clustering (2023). arXiv preprint arXiv:2303.12212 Brzozowski, Ł., Siudem, G., Gagolewski, M.: Community detection in complex networks via node similarity, graph representation learning, and hierarchical clustering (2023). arXiv preprint arXiv:​2303.​12212
8.
Zurück zum Zitat Castrillo, E., León, E., Gómez, J.: Fast heuristic algorithm for multi-scale hierarchical community detection. In: Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pp. 982–989 (2017) Castrillo, E., León, E., Gómez, J.: Fast heuristic algorithm for multi-scale hierarchical community detection. In: Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, pp. 982–989 (2017)
9.
Zurück zum Zitat Clauset, A., Moore, C., Newman, M.E.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98–101 (2008)CrossRef Clauset, A., Moore, C., Newman, M.E.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98–101 (2008)CrossRef
10.
Zurück zum Zitat Collins, L.M., Dent, C.W.: Omega: a general formulation of the rand index of cluster recovery suitable for non-disjoint solutions. Multivar. Behav. Res. 23(2), 231–242 (1988)CrossRef Collins, L.M., Dent, C.W.: Omega: a general formulation of the rand index of cluster recovery suitable for non-disjoint solutions. Multivar. Behav. Res. 23(2), 231–242 (1988)CrossRef
12.
Zurück zum Zitat El Ayeb, S., Hemery, B., Jeanne, F., Cherrier, E., Charrier, C.: Evaluation metrics for overlapping community detection. In: 2022 IEEE 47th Conference on Local Computer Networks (LCN), pp. 355–358. IEEE (2022) El Ayeb, S., Hemery, B., Jeanne, F., Cherrier, E., Charrier, C.: Evaluation metrics for overlapping community detection. In: 2022 IEEE 47th Conference on Local Computer Networks (LCN), pp. 355–358. IEEE (2022)
13.
Zurück zum Zitat Farkas, I., Ábel, D., Palla, G., Vicsek, T.: Weighted network modules. New J. Phys. 9(6), 180 (2007)CrossRef Farkas, I., Ábel, D., Palla, G., Vicsek, T.: Weighted network modules. New J. Phys. 9(6), 180 (2007)CrossRef
14.
Zurück zum Zitat Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010) Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010)
15.
Zurück zum Zitat Gupta, S.K., Singh, D.P., Choudhary, J.: A review of clique-based overlapping community detection algorithms. Knowl. Inf. Syst. 64(8), 2023–2058 (2022)CrossRef Gupta, S.K., Singh, D.P., Choudhary, J.: A review of clique-based overlapping community detection algorithms. Knowl. Inf. Syst. 64(8), 2023–2058 (2022)CrossRef
16.
Zurück zum Zitat Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009) Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009)
17.
Zurück zum Zitat Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009) Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009)
18.
Zurück zum Zitat Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS One 6(4), e18961 (2011) Lancichinetti, A., Radicchi, F., Ramasco, J.J., Fortunato, S.: Finding statistically significant communities in networks. PloS One 6(4), e18961 (2011)
19.
Zurück zum Zitat Lázár, A., Abel, D., Vicsek, T.: Modularity measure of networks with overlapping communities. EPL (Europhysics Letters) 90(1), 18001 (2010) Lázár, A., Abel, D., Vicsek, T.: Modularity measure of networks with overlapping communities. EPL (Europhysics Letters) 90(1), 18001 (2010)
20.
Zurück zum Zitat Lee, C., Reid, F., McDaid, A., Hurley, N.: Detecting highly overlapping community structure by greedy clique expansion (2010). arXiv preprint arXiv:1002.1827 Lee, C., Reid, F., McDaid, A., Hurley, N.: Detecting highly overlapping community structure by greedy clique expansion (2010). arXiv preprint arXiv:​1002.​1827
21.
Zurück zum Zitat Li, M., Chen, J.e., Wang, J.x., Hu, B., Chen, G.: Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinform. 9(1), 1–16 (2008) Li, M., Chen, J.e., Wang, J.x., Hu, B., Chen, G.: Modifying the DPClus algorithm for identifying protein complexes based on new topological structures. BMC Bioinform. 9(1), 1–16 (2008)
22.
Zurück zum Zitat Li, T., et al.: Hierarchical community detection by recursive partitioning. J. Am. Stat. Assoc. pp. 1–18 (2020) Li, T., et al.: Hierarchical community detection by recursive partitioning. J. Am. Stat. Assoc. pp. 1–18 (2020)
23.
Zurück zum Zitat Li, X.L., Foo, C.S., Tan, S.H., Ng, S.K.: Interaction graph mining for protein complexes using local clique merging. Genome Inform. 16(2), 260–269 (2005) Li, X.L., Foo, C.S., Tan, S.H., Ng, S.K.: Interaction graph mining for protein complexes using local clique merging. Genome Inform. 16(2), 260–269 (2005)
24.
Zurück zum Zitat Lu, H., Sang, X., Zhao, Q., Lu, J.: Community detection algorithm based on nonnegative matrix factorization and improved density peak clustering. IEEE Access 8, 5749–5759 (2020)CrossRef Lu, H., Sang, X., Zhao, Q., Lu, J.: Community detection algorithm based on nonnegative matrix factorization and improved density peak clustering. IEEE Access 8, 5749–5759 (2020)CrossRef
25.
Zurück zum Zitat Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005) Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005)
26.
Zurück zum Zitat Porter, M.A., Onnela, J.P., Mucha, P.J.: Communities in networks. Not. AMS 56(9), 1082–1097 (2009)MathSciNet Porter, M.A., Onnela, J.P., Mucha, P.J.: Communities in networks. Not. AMS 56(9), 1082–1097 (2009)MathSciNet
27.
Zurück zum Zitat Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007) Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)
29.
Zurück zum Zitat Rossetti, G.: graph benchmark handling community dynamics. J. Complex Netw. 5(6), 893–912 (2017)CrossRef Rossetti, G.: graph benchmark handling community dynamics. J. Complex Netw. 5(6), 893–912 (2017)CrossRef
30.
Zurück zum Zitat Rossetti, G., Milli, L., Cazabet, R.: CDLIB: a python library to extract, compare and evaluate communities from complex networks. Appl. Netw. Sci. 4(1), 1–26 (2019)CrossRef Rossetti, G., Milli, L., Cazabet, R.: CDLIB: a python library to extract, compare and evaluate communities from complex networks. Appl. Netw. Sci. 4(1), 1–26 (2019)CrossRef
32.
Zurück zum Zitat Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118–1123 (2008)CrossRef Rosvall, M., Bergstrom, C.T.: Maps of random walks on complex networks reveal community structure. Proc. Natl. Acad. Sci. 105(4), 1118–1123 (2008)CrossRef
33.
Zurück zum Zitat Saoud, B., Moussaoui, A.: Node similarity and modularity for finding communities in networks. Phys. A 492, 1958–1966 (2018)CrossRef Saoud, B., Moussaoui, A.: Node similarity and modularity for finding communities in networks. Phys. A 492, 1958–1966 (2018)CrossRef
34.
Zurück zum Zitat Schaub, M.T., Li, J., Peel, L.: Hierarchical community structure in networks. Phys. Rev. E 107(5), 054305 (2023) Schaub, M.T., Li, J., Peel, L.: Hierarchical community structure in networks. Phys. Rev. E 107(5), 054305 (2023)
35.
Zurück zum Zitat Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Phys. A 388(8), 1706–1712 (2009)CrossRef Shen, H., Cheng, X., Cai, K., Hu, M.B.: Detect overlapping and hierarchical community structure in networks. Phys. A 388(8), 1706–1712 (2009)CrossRef
36.
Zurück zum Zitat Shen, H.W., Cheng, X.Q., Guo, J.F.: Quantifying and identifying the overlapping community structure in networks. J. Stat. Mech. Theor. Exp. 2009(07), P07042 (2009) Shen, H.W., Cheng, X.Q., Guo, J.F.: Quantifying and identifying the overlapping community structure in networks. J. Stat. Mech. Theor. Exp. 2009(07), P07042 (2009)
37.
Zurück zum Zitat Simon, H.A.: The architecture of complexity. Proc. Am. Philos. Soc. 106(6), 467–482 (1962) Simon, H.A.: The architecture of complexity. Proc. Am. Philos. Soc. 106(6), 467–482 (1962)
38.
Zurück zum Zitat Snášel, V., Dráždilová, P., Platoš, J.: Closed trail distance in a biconnected graph. Plos One 13(8), e0202181 (2018) Snášel, V., Dráždilová, P., Platoš, J.: Closed trail distance in a biconnected graph. Plos One 13(8), e0202181 (2018)
39.
Zurück zum Zitat Snášel, V., Dráždilová, P., Platoš, J.: Cliques are bricks for k-CT graphs. Mathematics 9(11), 1160 (2021)CrossRef Snášel, V., Dráždilová, P., Platoš, J.: Cliques are bricks for k-CT graphs. Mathematics 9(11), 1160 (2021)CrossRef
40.
Zurück zum Zitat Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325–336 (1984)MathSciNetCrossRef Suurballe, J.W., Tarjan, R.E.: A quick method for finding shortest pairs of disjoint paths. Networks 14(2), 325–336 (1984)MathSciNetCrossRef
41.
Zurück zum Zitat Vieira, V.D.F., Xavier, C.R., Evsukoff, A.G.: A comparative study of overlapping community detection methods from the perspective of the structural properties. Appl. Netw. Sci. 5, 51 (2020) Vieira, V.D.F., Xavier, C.R., Evsukoff, A.G.: A comparative study of overlapping community detection methods from the perspective of the structural properties. Appl. Netw. Sci. 5, 51 (2020)
42.
Zurück zum Zitat Wasserman, S., Faust, K.: Social network analysis: Methods and applications, vol. 8. Cambridge University Press (1994) Wasserman, S., Faust, K.: Social network analysis: Methods and applications, vol. 8. Cambridge University Press (1994)
43.
Zurück zum Zitat Xie, J., Szymanski, B.K., Liu, X.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops, pp. 344–349. IEEE (2011) Xie, J., Szymanski, B.K., Liu, X.: SLPA: uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process. In: 2011 IEEE 11th International Conference on Data Mining Workshops, pp. 344–349. IEEE (2011)
44.
Zurück zum Zitat Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587–596 (2013) Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587–596 (2013)
45.
Zurück zum Zitat Zhang, X., Wang, C., Su, Y., Pan, L., Zhang, H.F.: A fast overlapping community detection algorithm based on weak cliques for large-scale networks. IEEE Trans. Comput. Soc. Syst. 4(4), 218–230 (2017)CrossRef Zhang, X., Wang, C., Su, Y., Pan, L., Zhang, H.F.: A fast overlapping community detection algorithm based on weak cliques for large-scale networks. IEEE Trans. Comput. Soc. Syst. 4(4), 218–230 (2017)CrossRef
46.
Zurück zum Zitat Zhang, Y., Levina, E., Zhu, J.: Detecting overlapping communities in networks using spectral methods. SIAM J. Math. Data Sci. 2(2), 265–283 (2020)MathSciNetCrossRef Zhang, Y., Levina, E., Zhu, J.: Detecting overlapping communities in networks using spectral methods. SIAM J. Math. Data Sci. 2(2), 265–283 (2020)MathSciNetCrossRef
47.
Zurück zum Zitat Zhao, Y., Li, S., Wang, S.: Agglomerative clustering based on label propagation for detecting overlapping and hierarchical communities in complex networks. Adv. Complex Syst. 17(06), 1450021 (2014) Zhao, Y., Li, S., Wang, S.: Agglomerative clustering based on label propagation for detecting overlapping and hierarchical communities in complex networks. Adv. Complex Syst. 17(06), 1450021 (2014)
Metadaten
Titel
Hierarchical Overlapping Community Detection for Weighted Networks
verfasst von
Petr Prokop
Pavla Dráždilová
Jan Platoš
Copyright-Jahr
2024
DOI
https://doi.org/10.1007/978-3-031-53499-7_13

Premium Partner