On detecting maximal quasi antagonistic communities in signed graphs
Data Mining and Knowledge Discovery, Volume 30, Issue 1, 2015.
Signed graphBi-cliqueQuasi antagonistic communityEnumeration treePower law distribution
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
Full Text (Upload PDF)