arXiv · 0710.4867
Bi-clique Communities
Abstract
We present a novel method for detecting communities in bipartite networks. Based on an extension of the $k$-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 $k$-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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sune Lehmann, Martin Schwartz, Lars Kai Hansen. 2008-07-07. Bi-clique Communities. https://doi.org/10.1103/physreve.78.016108
Cite the original work for its findings. Save a collection to share your selection of sources.