Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

Scalable Seed Expansion for Identifying Web Communities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Min Han ; Fac. of Electron. Inf. & Electr. Eng., Dalian Univ. of Technol., Dalian, China ; Hong Shen ; Xianchao Zhang

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.

Published in:

Parallel Architectures, Algorithms and Programming (PAAP), 2011 Fourth International Symposium on

Date of Conference:

9-11 Dec. 2011