ACM Home Page
Please provide us with feedback. Feedback
Modularities for bipartite networks
Full text PdfPdf (485 KB)
Source
Conference on Hypertext and Hypermedia archive
Proceedings of the 20th ACM conference on Hypertext and hypermedia table of contents
Torino, Italy
SESSION: Networks properties table of contents
Pages 245-250  
Year of Publication: 2009
ISBN:978-1-60558-486-7
Author
Tsuyoshi Murata  Tokyo Institute of Technology, Tokyo, Japan
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 61,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1557914.1557956
What is a DOI?

ABSTRACT

Real-world relations are often represented as bipartite networks, such as paper-author networks and event-attendee networks. Extracting dense subnetworks (communities) from bipartite networks and evaluating their qualities are practically important research topics. As the attempts for evaluating divisions of bipartite networks, Guimera and Barber propose bipartite modularities. This paper discusses the properties of these bipartite modularities and proposes another bipartite modularity that allows one-to-many correspondence of communities of different vertex types. Preliminary experimental results for the bipartite modularities are also described.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. J. Barber. Modularity and community detection in bipartite networks. Physical Review E, 76(066102):1--9, 2007.
 
2
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre. Fast unfolding of community hierarchies in large networks. Journal of Statistical Mechanics: Theory and Experiment, P10008:1--12, 2008.
 
3
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(066111):1--6, 2004.
 
4
L. Danon, A. Diaz-Guilera, J. Duch, and A. Arenas. Comparing community structure identification. Journal of Statistical Mechanics, P09008:1--10, 2005.
 
5
A. Davis, B. B. Gardner, and M. R. Gardner. Deep South. University of Chicago Press, 1941.
6
 
7
S. Fortunato and M. Barthelemy. Resolution limit in community detection. In Proceedings of the National Academy of Sciences of the United States of America, 104, 1, 36--41, 2007.
 
8
R. Guimera, M. Sales-Pardo, and L. A. N. Amaral. Module identification in bipartite and directed networks. Physical Review, 76(036102):1--8, 2007.
 
9
 
10
M. E. J. Newman. Modularity and community structure in networks. In Proceedings of the National Academy of Sciences of the United States of America, 103, 8577--8582, 2006.
 
11
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69(026113):1--15, 2004.
 
12
A. Tanay, R. Sharan, and R. Shamir. Discovering statistically significant biclusters in gene expression data. Bioinformatics, 18(Suppl.1):S136--S144, 2002.