All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Graph neural network inspired algorithm for unsupervised network community detection

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14310%2F22%3A00127675" target="_blank" >RIV/00216224:14310/22:00127675 - isvavai.cz</a>

  • Result on the web

    <a href="https://appliednetsci.springeropen.com/articles/10.1007/s41109-022-00500-z" target="_blank" >https://appliednetsci.springeropen.com/articles/10.1007/s41109-022-00500-z</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s41109-022-00500-z" target="_blank" >10.1007/s41109-022-00500-z</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Graph neural network inspired algorithm for unsupervised network community detection

  • Original language description

    Network community detection often relies on optimizing partition quality functions, like modularity. This optimization appears to be a complex problem traditionally relying on discrete heuristics. And although the problem could be reformulated as continuous optimization, direct application of the standard optimization methods has limited efficiency in overcoming the numerous local extrema. However, the rise of deep learning and its applications to graphs offers new opportunities. And while graph neural networks have been used for supervised and unsupervised learning on networks, their application to modularity optimization has not been explored yet. This paper proposes a new variant of the recurrent graph neural network algorithm for unsupervised network community detection through modularity optimization. The new algorithm’s performance is compared against the state-of-the-art methods. The approach also serves as a proof-of-concept for the broader application of recurrent graph neural networks to unsupervised network optimization.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

    <a href="/en/project/EF16_019%2F0000822" target="_blank" >EF16_019/0000822: CyberSecurity, CyberCrime and Critical Information Infrastructures Center of Excellence</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Applied Network Science

  • ISSN

    2364-8228

  • e-ISSN

    2364-8228

  • Volume of the periodical

    7

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    19

  • Pages from-to

    1-19

  • UT code for WoS article

    000850086300002

  • EID of the result in the Scopus database

    2-s2.0-85137540458