Skip to main content

2023 | OriginalPaper | Buchkapitel

Dynamic Local Community Detection with Anchors

verfasst von : Konstantinos Christopoulos, Georgia Baltsou, Konstantinos Tsichlas

Erschienen in: Complex Networks and Their Applications XI

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Community detection is a challenging research problem, especially in dynamic networks, since in this case communities cannot remain stable as they evolve. In evolving networks new communities may emerge and existing communities may disappear, grow or shrink. There are many cases where someone is more interested in the evolution of a particular community, to which an important node belongs, rather than in the global partitioning of a dynamic network. However, due to the drifting problem where one community can evolve into a completely different one, it is difficult to track the evolution of communities. Our aim is to identify the community that contains a node of particular importance, called anchor, and its evolution over time. The framework we propose circumvents the identity problem by allowing the anchor to define the core of the relevant community partially or fully. Preliminary experiments with synthetic datasets demonstrate the positive aspects of the proposed framework in identifying communities with high accuracy.

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!

Fußnoten
1
We use the terms updates and actions interchangeably to refer to a small change in the network, such as edge insertion or/and deletion.
 
2
The avalanche effect corresponds to the phenomenon where communities can experience substantial drifts compared to what a static algorithm computes in each time instance.
 
3
If the quality metric is Conductance then the fitness score must be decreased and so, the fitness scores should be in a decreasing order.
 
Literatur
1.
Zurück zum Zitat Baltsou, G., Tsichlas, K.: Dynamic community detection with anchors (2022) Baltsou, G., Tsichlas, K.: Dynamic community detection with anchors (2022)
2.
Zurück zum Zitat Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: International Conference on Ad-Hoc Networks and Wireless, pp. 346–359. Springer (2011) Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: International Conference on Ad-Hoc Networks and Wireless, pp. 346–359. Springer (2011)
3.
Zurück zum Zitat Chen, J., Zaiane, O.S., Goebel, R.: Detecting communities in large networks by iterative local expansion. In: 2009 International Conference on Computational Aspects of Social Networks, pp. 105–112. IEEE (2009) Chen, J., Zaiane, O.S., Goebel, R.: Detecting communities in large networks by iterative local expansion. In: 2009 International Conference on Computational Aspects of Social Networks, pp. 105–112. IEEE (2009)
4.
Zurück zum Zitat DiTursi D.J., Ghosh, G., Bogdanov, P.: Local community detection in dynamic networks. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 847–852. IEEE (2017) DiTursi D.J., Ghosh, G., Bogdanov, P.: Local community detection in dynamic networks. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 847–852. IEEE (2017)
5.
Zurück zum Zitat F1 score lemma. F1 score lemma—Wikipedia, the free encyclopedia (2020) F1 score lemma. F1 score lemma—Wikipedia, the free encyclopedia (2020)
6.
Zurück zum Zitat Gao, Y., Zhang, H., Zhang, Y.: Overlapping community detection based on conductance optimization in large-scale networks. Phys. A Stat. Mech. Appl. 522, 69–79 (2019)CrossRefMATH Gao, Y., Zhang, H., Zhang, Y.: Overlapping community detection based on conductance optimization in large-scale networks. Phys. A Stat. Mech. Appl. 522, 69–79 (2019)CrossRefMATH
7.
Zurück zum Zitat Guo, K., He, L., Huang, J., Chen, Y., Lin, B.: A local dynamic community detection algorithm based on node contribution. In: CCF Conference on Computer Supported Cooperative Work and Social Computing, pp. 363–376. Springer (2019) Guo, K., He, L., Huang, J., Chen, Y., Lin, B.: A local dynamic community detection algorithm based on node contribution. In: CCF Conference on Computer Supported Cooperative Work and Social Computing, pp. 363–376. Springer (2019)
8.
Zurück zum Zitat Havemann, F., Heinz, M., Struck, A., Gläser, J.: Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels. J. Stat. Mech. Theory Exp. 2011(01), P01023 (2011)CrossRef Havemann, F., Heinz, M., Struck, A., Gläser, J.: Identification of overlapping communities and their hierarchy by locally calculating community-changing resolution levels. J. Stat. Mech. Theory Exp. 2011(01), P01023 (2011)CrossRef
9.
Zurück zum Zitat Kostakos, V.: Temporal graphs. Phys. A Stat. Mech. Appl. 388(6), 1007–1023 (2009)CrossRef Kostakos, V.: Temporal graphs. Phys. A Stat. Mech. Appl. 388(6), 1007–1023 (2009)CrossRef
10.
Zurück zum Zitat Liakos, P., Papakonstantinopoulou, K., Ntoulas, A., Delis, A.: Rapid detection of local communities in graph streams. IEEE Trans. Knowl. Data Eng. (2020) Liakos, P., Papakonstantinopoulou, K., Ntoulas, A., Delis, A.: Rapid detection of local communities in graph streams. IEEE Trans. Knowl. Data Eng. (2020)
11.
Zurück zum Zitat Luo, F., Wang, J.Z., Promislow, E.: Exploring local community structures in large networks. Web Intel. Agent Syst. Int. J. 6(4), 387–400 (2008) Luo, F., Wang, J.Z., Promislow, E.: Exploring local community structures in large networks. Web Intel. Agent Syst. Int. J. 6(4), 387–400 (2008)
12.
Zurück zum Zitat Rossetti, G.: Rdyn: graph benchmark handling community dynamics. J. Complex Netw. 5(6), 893–912 (2017)CrossRef Rossetti, G.: Rdyn: graph benchmark handling community dynamics. J. Complex Netw. 5(6), 893–912 (2017)CrossRef
13.
Zurück zum Zitat Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. (CSUR) 51(2), 1–37 (2018)CrossRef Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. (CSUR) 51(2), 1–37 (2018)CrossRef
14.
Zurück zum Zitat Takaffoli, R.R., Zaïane, O.R.: Incremental local community identification in dynamic social networks. In: 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013), pp. 90–94. IEEE (2013) Takaffoli, R.R., Zaïane, O.R.: Incremental local community identification in dynamic social networks. In: 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013), pp. 90–94. IEEE (2013)
15.
Zurück zum Zitat Yang, Y., Wang, M., Bindel, D., He, K.: Streaming local community detection through approximate conductance, pp. arXiv–2110 (2021) Yang, Y., Wang, M., Bindel, D., He, K.: Streaming local community detection through approximate conductance, pp. arXiv–2110 (2021)
16.
Zurück zum Zitat Zakrzewska, A., Bader, D.A.: A dynamic algorithm for local community detection in graphs. In: 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 559–564. IEEE (2015) Zakrzewska, A., Bader, D.A.: A dynamic algorithm for local community detection in graphs. In: 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 559–564. IEEE (2015)
17.
Zurück zum Zitat Zakrzewska, A., Bader, D.A.: Tracking local communities in streaming graphs with a dynamic algorithm. Social Netw. Anal. Mining 6(1), 1–16 (2016) Zakrzewska, A., Bader, D.A.: Tracking local communities in streaming graphs with a dynamic algorithm. Social Netw. Anal. Mining 6(1), 1–16 (2016)
Metadaten
Titel
Dynamic Local Community Detection with Anchors
verfasst von
Konstantinos Christopoulos
Georgia Baltsou
Konstantinos Tsichlas
Copyright-Jahr
2023
DOI
https://doi.org/10.1007/978-3-031-21131-7_16

Premium Partner