Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Scalable seed expansion for identifying Web communities|
|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|
|Conference Name:||IEEE International Symposium on Parallel Architectures, Algorithms and Programming (4th : 2011 : Tianjin, China)|
|Min Han, Hong Shen and Xianchao Zhang|
|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.|
|Rights:||© 2011 IEEE|
|Appears in Collections:||Electrical and Electronic Engineering publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.