Abstract: Architecture for extracting link spam communities when given one or more members of the community. A link spam extraction algorithm is provided that takes as input link spam seeds and extracts other nearby link spam through a biased local random walk around the seed(s). The seed set is provided by a user (or an automated algorithm scrubbed by a human) which the algorithm uses to simulate a random walk on a web graph. The random walk can be biased to explore a local neighborhood around the seed set through use of decay probabilities. Truncation can be used to retain only the most frequently visited nodes. After termination, the nodes are sorted in decreasing order of final probabilities and presented to the user. Human judges need only make decisions at the spam community level, thereby limiting involvement, and human input can be scaled by several orders of magnitude.