Bi-clique Communities

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
10 pages, 6 figures

Keywords

Data Analysis, Statistics and Probability, Physics and Society

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/165308

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0710.4867
 http://arxiv.org/abs/0710.4867
 Phys. Rev. E, v78, p016108 (2008)
 doi:10.1103/PhysRevE.78.016108

Collections

arXiv