Extracting and ranking viral communities using seeds and content similarity

Authors:
Hyun Chul Lee;Allan Borodin;Leslie Goldsmith
Affiliations:
University of Toronto, Toronto, ON, Canada;University of Toronto, Toronto, ON, Canada;Affinity Systems, Mississauga, ON, Canada
Venue:
Proceedings of the nineteenth ACM conference on Hypertext and hypermedia
Year:
2008

Citing 22
Cited 2

A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A fast parametric maximum flow algorithm and applications

SIAM Journal on Computing
Improved algorithms for topic distillation in a hyperlinked environment

Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Trawling the Web for emerging cyber-communities

WWW '99 Proceedings of the eighth international conference on World Wide Web
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Efficient identification of Web communities

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

Journal of the ACM (JACM)
Mining the Web's Link Structure

Computer
A Comparative Study on Feature Selection in Text Categorization

ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Bursty and hierarchical structure in streams

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
A new paradigm for ranking pages on the world wide web

WWW '03 Proceedings of the 12th international conference on World Wide Web
Mining the peanut gallery: opinion extraction and semantic classification of product reviews

WWW '03 Proceedings of the 12th international conference on World Wide Web
Relationship-based clustering and cluster ensembles for high-dimensional data mining

Relationship-based clustering and cluster ensembles for high-dimensional data mining
Distributional clustering of English words

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Communities from seed sets

Proceedings of the 15th international conference on World Wide Web
Building implicit links from content for forum search

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Graph-based text classification: learn from your neighbors

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Blog Community Discovery and Evolution Based on Mutual Awareness Expansion

WI '07 Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence
Probabilistic community discovery using hierarchical latent Gaussian mixture model

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Influential nodes in a diffusion model for social networks

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Topical Analysis for Identification of Web Communities

AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Extracting local web communities using lexical similarity

DASFAA'10 Proceedings of the 15th international conference on Database systems for advanced applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the community extraction problem within the context of networks of blogs and forums. When starting from a small set of known seed nodes, we argue that the use of content information (beyond explicit link information) plays an essential role in the identification of the relevant community. Our approach lends itself to a new and insightful ranking scheme for members of the extracted community and an efficient algorithm for inflating/deflating the extracted community. Using a considerably large commercial data set of blog and forum sites, we provide experimental evidence to demonstrate the utility, efficiency, and stability of our methods.