Biclique communities

Publication: Research - peer-reviewJournal article – Annual report year: 2008

View graph of relations

We present a 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 biclique 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 biclique community detection algorithm provides a level of flexibility by incorporating independent clique thresholds for each of the nonoverlapping node sets in the bipartite network
Original languageEnglish
JournalPhysical Review E (Statistical, Nonlinear, and Soft Matter Physics)
Publication date2008
Volume78
Issue1
Pages016108
ISSN1539-3755
DOIs
StatePublished

Bibliographical note

Copyright 2008 American Physical Society

CitationsWeb of Science® Times Cited: 19

Keywords

  • networks, evolution
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 4829761