Efficient identification of web communities

Gary William Flake, Steve Lawrence, C. Lee Giles

Research output: Chapter in Book/Report/Conference proceedingConference contribution

558 Scopus citations

Abstract

We define a community 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 efficiently identified in a maximum flow / minimum cut framework, where the source is composed of known members, and the sink consists of well-known non-members. A focused crawler that crawls to a fixed depth can approximate community membership by augmenting the graph induced by the crawl with links to a virtual sink node. The effectiveness of the approximation algorithm is demonstrated with several crawl results that identify hubs, authorities, web rings, and other link topologies that are useful but not easily categorized. Applications of our approach include focused crawlers and search engines, automatic population of portal categories, and improved filtering.

Original languageEnglish (US)
Title of host publicationProceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
EditorsR. Ramakrishnan, S. Stolfo, R. Bayardo, I. Parsa, R. Ramakrishnan, S. Stolfo, R. Bayardo, I. Parsa
PublisherAssociation for Computing Machinery (ACM)
Pages150-160
Number of pages11
ISBN (Print)1581132336, 9781581132335
DOIs
StatePublished - Jan 1 2000
EventProceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001) - Boston, MA, United States
Duration: Aug 20 2000Aug 23 2000

Publication series

NameProceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Other

OtherProceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001)
CountryUnited States
CityBoston, MA
Period8/20/008/23/00

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Efficient identification of web communities'. Together they form a unique fingerprint.

  • Cite this

    Flake, G. W., Lawrence, S., & Giles, C. L. (2000). Efficient identification of web communities. In R. Ramakrishnan, S. Stolfo, R. Bayardo, I. Parsa, R. Ramakrishnan, S. Stolfo, R. Bayardo, & I. Parsa (Eds.), Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 150-160). (Proceeding of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining). Association for Computing Machinery (ACM). https://doi.org/10.1145/347090.347121