Scalable seed expansion for identifying Web communities
Date
2011
Authors
Han, M.
Shen, H.
Zhang, X.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 4th IEEE International Symposium on Parallel Architectures, Algorithms and Programming, held in Tianjin, China, 9-11 December, 2011 / Jigang Wu, Guozhi Song, Hong Shen and Guoliang Chen (eds.), pp.141-145
Statement of Responsibility
Min Han, Hong Shen and Xianchao Zhang
Conference Name
IEEE International Symposium on Parallel Architectures, Algorithms and Programming (4th : 2011 : Tianjin, China)
Abstract
We study the problem of identifying Web communities around some seed vertex. In this work, we propose a fast graph algorithm to expand Web communities in a scalable style. Given a seed vertex, our algorithm computes approximate personalized PageRank vectors with better and better approximations, and finds the smallest conductance sets on these vectors as candidate communities in nearly-linear time. At the end, it returns the candidate community with the smallest conductance as the result community. We also define local community profile (LCP) to investigate structural and statistical properties of Web communities in a local range. Theoretical analysis and primary experiments both show the efficiency of the proposed algorithm and the quality of the results.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
© 2011 IEEE