Bi-clique Communities

Simple item page
dc.creatorLehmann, Sune
dc.creatorSchwartz, Martin
dc.creatorHansen, Lars Kai
dc.date2007-10-25
dc.date2008-07-07
dc.date.accessioned2026-07-07T09:51:37Z
dc.date.available2026-07-07T09:51:37Z
dc.descriptionWe 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.
dc.description10 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/0710.4867
dc.identifierhttp://arxiv.org/abs/0710.4867
dc.identifierPhys. Rev. E, v78, p016108 (2008)
dc.identifierdoi:10.1103/PhysRevE.78.016108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165308
dc.subjectData Analysis, Statistics and Probability
dc.subjectPhysics and Society
dc.titleBi-clique Communities
dc.typetext

Files

Collections

arXiv