Skip to main content
SpringerLink
Log in

Discovery of Web Communities Based on the Co-occurrence of References

  • Conference paper
  • First Online:
Discovery Science (DS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1967))

Included in the following conference series:

Abstract

This paper proposes a method of discovering Web communities A complete bipartite graph K i;j of Web pages can be regarded as a community sharing a common interest. Discovery of such community is expected to assist users’ information retrieval from theWeb. The method proposed in this paper is based on the assumption that hyperlinks to related Web pages often co-occur. Relations of Web pages are detected by the co-occurrence of hyperlinks on the pages which are acquired from a search engine by backlink search. In order to find a new member of a Web community, all the hyperlinks contained in the acquired pages are extracted. Then a page which is pointed by the most frequent hyperlinks is regarded as a new member of the community. We have build a system which discovers complete bipartite graphs based on the method. Only from a few URLs of initial community members, the system succeeds in discovering several genres of Web communities without analyzing the contents of Web pages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Baeza-Yates and B. Ribeiro-Neto, “Modern Information Retrieval”, Addison Wesley, 1999.

    Google Scholar 

  2. S. Brin and L. Page, “The Anatomy of a Large-Scale Hypertextual Web Search Engine”, Proceedings of the 7th International WWW Conference, 1998.

    Google Scholar 

  3. A. Z. Brooder, S. C. Glassman, and M. S. Manasse, “Syntactic Clustering of the Web”, Proceedings of the 6th International WWW Conference, pp.391–404, 1997.

    Google Scholar 

  4. S. K. Card, J. D. Mackinlay, and B. Shneiderman, “Readings in Information Visualization-Using Vision to Think-”, Morgan Kaufmann, 1999.

    Google Scholar 

  5. S. Chakrabarti, B. E. Dom and P. Indyk, “Enhanced hypertext classification using hyperlinks”, Proceedings of ACM SIGMOD, 1998.

    Google Scholar 

  6. C.-H. Chang and C.-C. Hsu, “Customizable Multi-engine Search Tools with Clustering”, Proceedings of the 6th International WWW Conference, 1997.

    Google Scholar 

  7. The Clever Project, “Hypersearching the Web”, Scientific American, http://www.sciam.com/1999/0699issue/0699raghavan.html, 1999.

  8. Inktomi and NEC Research Institute. “Web Surpasses One Billion Documents”. http://www.ink tomi.com/new/press/billion.html, 2000.

  9. D. Jensen and H. Goldberg Cochairs, “Artificial Intelligence amp; Link Analysis”, Technical Report FS-98-01, AAAI Press, 1998.

    Google Scholar 

  10. H. Kauts, B. Selman, and M. Shah, “The Hidden Web”, AI Magazine, vol. 18, no. 2, pp.27–36, 1997.

    Google Scholar 

  11. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan and A. S. Tomkins, “The Web as a Graph: Measurements, Models, and Methods”, Proceedings of the 5th Annual International Conference on Computing and Combinatorics, Lecture Notes in Computer Science 1627, pp.1–17, 1999.

    Google Scholar 

  12. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins, “Trawling the web for emerging cyber-communities”, Proceedings of the 8th WWW conference, 1999.

    Google Scholar 

  13. Y. Maarek, M. Jacovi, M. Shtalhaim, S. Ur, D. Zernik, and I. Z. B. Shaul, “WebCutter: A system for dynamic and tailorable site mapping”, Proceedings of the Sixth International WWW Conference, pp.713–722, 1997.

    Google Scholar 

  14. T. Murata, “Machine Discovery Based on the Co-occurrence of References in a Search Engine”, Proceedings of the Second International Conference on Discovery Science (DS’99), Lecture Notes in Artificial Intelligence 1721, pp.220–229, 1999.

    Google Scholar 

  15. L. Page, “The PageRank Citation Ranking: Bringing Order to the Web”, http://google.stanford.edu/~backrub/pageranksub.ps, 1998.

  16. J. Rucker and M. J. Polanco, “Personalized Navigation for the Web”, Communications of the ACM, vol. 40, no. 3, pp. 73–75, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Gunma University, 1-5-1 Tenjin-cho, 376-8515, Kiryu, Gunma, Japan

    Tsuyoshi Murata

Authors
  1. Tsuyoshi Murata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Information Science and Electrical Engineering, Department of Informatics, Kyushu University, 6-10-1 Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Setsuo Arikawa

  2. Faculty of Science Department of Information Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, 113-0033, Tokyo, Japan

    Shinichi Morishita

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murata, T. (2000). Discovery of Web Communities Based on the Co-occurrence of References. In: Arikawa, S., Morishita, S. (eds) Discovery Science. DS 2000. Lecture Notes in Computer Science(), vol 1967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44418-1_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-44418-1_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41352-3

  • Online ISBN: 978-3-540-44418-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation