Bi-clique Communities
Data Analysis, Statistics and Probability
2008-07-22 v2 Physics and Society
Abstract
We present a novel method for detecting communities in bipartite networks. Based on an extension of the -clique community detection algorithm, we demonstrate how modular structure in bipartite networks presents itself as overlapping bicliques. If bipartite information is available, the bi-clique community detection algorithm retains all of the advantages of the -clique algorithm, but avoids discarding important structural information when performing a one-mode projection of the network. Further, the bi-clique community detection algorithm provides a new level of flexibility by incorporating independent clique thresholds for each of the non-overlapping node sets in the bipartite network.
Cite
@article{arxiv.0710.4867,
title = {Bi-clique Communities},
author = {Sune Lehmann and Martin Schwartz and Lars Kai Hansen},
journal= {arXiv preprint arXiv:0710.4867},
year = {2008}
}
Comments
10 pages, 6 figures