By Topic

Detecting Communities from Bipartite Networks Based on Bipartite Modularities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Murata, T. ; Dept. of Comput. Sci., Tokyo Inst. of Technol., Tokyo, Japan

Discovering communities from networks is one of the important and challenging research topics of social network analysis. Although Newman's modularity is often used for evaluating division of unipartite networks, it is not suitable for evaluating division of bipartite networks that are composed of two types of vertices. To compensate for the situation, Guimera and Barber propose bipartite modularities. This paper discusses the characteristics of these bipartite modularities and proposes another bipartite modularity. Experimental results show that our new bipartite modularity allows one-to-many correspondence between communities of different vertex types.

Published in:

Computational Science and Engineering, 2009. CSE '09. International Conference on  (Volume:4 )

Date of Conference:

29-31 Aug. 2009