Abstract
Real-world networks naturally contain a lot of communities. Identifying the community structures is a crucial endeavor to analyze the networks. Here, we propose a novel algorithm which finds the community structures from seed expansion. Its expansion process bases on the transmissive probabilities coming from seed vertices and the modularity Q function which is firstly defined by Newman et al.. The experimental evaluation is conducted on real-world networks. The evaluation shows that our algorithm has good results in quality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review 69, 026113 (2004)
Fortunato, S., Castellano, C.: Community Structure in Graphs. Physics and Society (2007)
Montenegro, R., Tetali, P.: Mathematical Aspects of Mixing Times in Markov Chains. Foundations and Trends in Theoretical Computer Science, vol. 1(3) (2006)
Wei, F., Qian, W., Wang, C., Zhou, A.: Detecting overlapping community structures in networks. World Wide Web Journal 12(2), 235 (2009)
Zhu, Z., Wang, C., Ma, L., Pan, Y., Ding, Z.: Scalable Community Discovery of Large Networks. In: The Ninth International Conference on Web-Aged Information Management (2008)
Andersen, R., Lang, K.J.: Communities from seed sets. In: Proceedings of the 15th International World Wide Web Conference (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wei, F., Qian, W., Fei, Z., Zhou, A. (2010). Identifying Community Structures in Networks with Seed Expansion. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds) Database Systems for Advanced Applications. DASFAA 2010. Lecture Notes in Computer Science, vol 5981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12026-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-12026-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12025-1
Online ISBN: 978-3-642-12026-8
eBook Packages: Computer ScienceComputer Science (R0)