All
All

What are you looking for?

All
Projects
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”

Overlapping Communities in Bipartite Graphs

Result description

Community detection in bipartite networks with overlapping communities carries difficult problems when it comes to complex network analysis. In this paper, we propose a new model for generating such graphs. We combine several approaches based on stochastic block models using edge probabilities following the Poisson distribution. The proposed model can be reduced into their original model versions, such as a model for a bipartite graph with non-overlapping communities only. We present results of the generator. Its performance is evaluated using several known community detection techniques. The evaluation criterion assesses both a community’s identification and their overlaps.

Keywords

Stochastic block modelBipartite graphOverlapping communitiesGraph generator

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Overlapping Communities in Bipartite Graphs

  • Original language description

    Community detection in bipartite networks with overlapping communities carries difficult problems when it comes to complex network analysis. In this paper, we propose a new model for generating such graphs. We combine several approaches based on stochastic block models using edge probabilities following the Poisson distribution. The proposed model can be reduced into their original model versions, such as a model for a bipartite graph with non-overlapping communities only. We present results of the generator. Its performance is evaluated using several known community detection techniques. The evaluation criterion assesses both a community’s identification and their overlaps.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

Others

  • Publication year

    2019

  • 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

  • Article name in the collection

    Complex Networks and Their Applications VII

  • ISBN

    978-3-030-05410-6

  • ISSN

    1860-9503

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    207-218

  • Publisher name

    Springer, Cham

  • Place of publication

  • Event location

    Cambridge

  • Event date

    Dec 11, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

Basic information

Result type

D - Article in proceedings

D

OECD FORD

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Year of implementation

2019