Abstract
Community discovery has often been achieved by assigning each node in a network only to one community. However, a node (e.g., user) might belong to several communities in real world networks. For undirected connected networks without self-loops, we proposed weighted line graphs based on the weights of the original network, as they do not contain self-loops as in the standard line graph in general graph theory. Overlapping community discovery is achieved by applying some off-the-shelf node partitioning method to the weighted line graphs. In this paper we report a performance evaluation of the weighted line graphs over both synthetic and real-world networks. The effectiveness of the weighted line graphs are investigated in terms of both the visualization of discovered communities and the generalized modularity measure. The results show that both the utilization of weights in the original networks and the self-loop free property contribute to the performance improvement.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70(6), 066111 (2004)
Diestel, R.: Graph Theory. Springer (2006)
Evans, T., Lambiotte, R.: Line graphs, link partitions, and overlapping communities. Physical Review E 80(1), 016105:1–016105:8 (2009)
Harville, D.A.: Matrix Algebra From a Statistican’s Perspective. Springer (2008)
Mika, P.: Social Networks and the Semantic Web. Springer (2007)
Newman, M.: Finding community structure using the eigenvectors of matrices. Physical Review E 76(3), 036104 (2006)
Newman, M.: Networks: An Introduction. Oxford University Press (2010)
Pons, P., Latapy, M.: Computing communities in large networks using random walks. Journal of Graph Algorithms 10(2), 191–218 (2006)
Raghavan, U., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76, 036106 (2007)
von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing 17(4), 395–416 (2007)
Yoshida, T.: Overlapping community discovery via weighted line graphs of networks. In: Anthony, P., Ishizuka, M., Lukose, D. (eds.) PRICAI 2012. LNCS (LNAI), vol. 7458, pp. 895–898. Springer, Heidelberg (2012)
Yoshida, T.: Toward finding hidden communities based on user profile. Journal of Intelligent Information Systems (in press, 2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshida, T. (2013). Weighted Line Graphs for Overlapping Community Discovery and their Evaluation. In: Tanaka, Y., Spyratos, N., Yoshida, T., Meghini, C. (eds) Information Search, Integration and Personalization. ISIP 2012. Communications in Computer and Information Science, vol 146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40140-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-40140-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40139-8
Online ISBN: 978-3-642-40140-4
eBook Packages: Computer ScienceComputer Science (R0)