On detecting maximal quasi antagonistic communities in signed graphs

    Data Mining and Knowledge Discovery, Volume 30, Issue 1, 2015.

    Cited by: 6|Bibtex|Views11|Links
    EI
    Keywords:
    Signed graphBi-cliqueQuasi antagonistic communityEnumeration treePower law distribution

    Abstract:

    Many networks can be modeled as signed graphs. These include social networks, and relationships/interactions networks. Detecting sub-structures in such networks helps us understand user behavior, predict links, and recommend products. In this paper, we detect dense sub-structures from a signed graph, called quasi antagonistic communities ...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments