Efficient identification of Web communities

@inproceedings{Flake2000EfficientIO,
  title={Efficient identification of Web communities},
  author={G. Flake and S. Lawrence and C. Lee Giles},
  booktitle={KDD '00},
  year={2000}
}
We de ne a communit y on the web as a set of sites that have more links (in either direction) to members of the community than to non-members. Members of such a community can be eAEciently iden ti ed in a maximum ow / minim um cut framework, where the source is composed of known members, and the sink consists of well-kno wn non-members. A focused crawler that crawls to a xed depth can approximate community membership by augmenting the graph induced by the cra wl with links to a virtual sink… Expand
Communities in Large Networks: Identification and Ranking
LOCAL IDENTIFICATION OF WEB GRAPH COMMUNITIES
Extraction and classification of dense communities in the web
Design and Evaluation of a User-Based Community Discovery Technique
Characterizing a national community web
Local Community Identification in Social Networks
Inferring web communities through relaxed cocitation and dense bipartite graphs
Graph Local Clustering for Topic Detection in Web Collections
...
1
2
3
4
5
...

References

SHOWING 1-2 OF 2 REFERENCES
Introduction to algorithms
Authoritative sources in a hyperlinked environment