Identifying community structures in networks with seed expansion

Authors:
Fang Wei;Weining Qian;Zhongchao Fei;Aoying Zhou
Affiliations:
Portfolio StrategySTechnology Leadership CTO Group, CPG, Alcatel-Lucent Shanghai Bell;Software Engineering Institute, East China Normal University, Shanghai, China;Portfolio StrategySTechnology Leadership CTO Group, CPG, Alcatel-Lucent Shanghai Bell;Software Engineering Institute, East China Normal University, Shanghai, China
Venue:
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Year:
2010

Citing 4
Cited 0

Communities from seed sets

Proceedings of the 15th international conference on World Wide Web
Mathematical aspects of mixing times in Markov chains

Foundations and Trends® in Theoretical Computer Science
Scalable Community Discovery of Large Networks

WAIM '08 Proceedings of the 2008 The Ninth International Conference on Web-Age Information Management
Detecting Overlapping Community Structures in Networks

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

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.