Key points are not available for this paper at this time.
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed set into a community with small conductance and a strong relationship to the seed, while examining only a small neighborhood of the entire graph. We extend existing results to give theoretical guarantees that apply to a variety of seed sets from specified communities. We also describe simple and flexible heuristics for applying these methods in practice, and present early experiments showing that these methods compare favorably with existing approaches.
Building similarity graph...
Analyzing shared references across papers
Loading...
Reid Andersen
Microsoft (United States)
Kevin Lang
Fred Hutch Cancer Center
University of California, San Diego
Yahoo (United States)
Yahoo (United Kingdom)
Building similarity graph...
Analyzing shared references across papers
Loading...
Andersen et al. (Tue,) studied this question.
synapsesocial.com/papers/6a17053d25571367076be175 — DOI: https://doi.org/10.1145/1135777.1135814