Searching for Communities in Bipartite Networks release_rogvcladpzgk7cuvqufhz3h3le

by Michael J. Barber, Margarida Faria, Ludwig Streit, Oleg Strogan

Released as a article .

2008  

Abstract

Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman's modularity measure. A specialized version of the modularity, adapted to be appropriate for bipartite networks, is presented; a corresponding algorithm is described for identifying community groups through maximizing this measure. The algorithm is applied to networks derived from the EU Framework Programs on Research and Technological Development. Community groups identified are compared using information-theoretic methods.
In text/plain format

Archived Files and Locations

application/pdf  194.0 kB
file_a2ebzsihjnadbjnhvacqa636g4
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2008-03-19
Version   v1
Language   en ?
arXiv  0803.2854v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 54467742-c9f8-4059-9120-2ab069d957c5
API URL: JSON