Skip to main content
SpringerLink
Log in

Visualization and Analysis of Web Graphs

  • Chapter
  • First Online:
Progress in Discovery Science

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

  • 501 Accesses

Abstract

We review the progress of our research on Web Graphs. A Web Graph is a directed graph whose nodes are Web pages and whose edges are hyperlinks between pages. Many people use bookmarks and pages of links as a knowledge on internet. We developed a visualization system of Web Graphs. It is a system for construction and analysis of Web graphs. For constructing and analysis of large graphs, the SVD (Singular Value Decomposition) of the adjacency matrix of the graph is used. The experimental application of the system yield some discovery that are unforseen by other approach. The scree plots of the singular values of the adjacency matrix is introduced and confirmed that can be used as a measure to evaluate the Web space.

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. Albert, R., Jeong, H., and Barabasi, A.: Diameter of the World Wide Web. Nature, 401, pp.130–131, 1999.

    Article  Google Scholar 

  2. H. Arimura and S. Shimozono, Maximizing Agreement with a Classification by Bounded or Unbounded Number of Asso ciated Words. Proc. the 9th International Symposium on Algorithms and Computation,1998.

    Google Scholar 

  3. H. Arimura, A. Wataki, R. Fujino, and S. Arikawa, A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. Proc. the 8th International Workshop on Algorithmic Learning Theory, Otzenhausen, Germany, Lecture Notes in Artificial Intelligence 1501, Springer-Verlag, pp. 247–261, 1998.

    Google Scholar 

  4. M. Berry, S. T. Dumains, and G. W. O’brien, Using Linear Algebra for Intelligent Information Retrieval, SIAM Reveview Vol. 37, pp. 573–595, 1995.

    Article  MATH  Google Scholar 

  5. M. W. Berry, Z. Drmac, and E. R. Jessup, Matrices, Vector Spaces, and Information Retrieval, SIAM Review Vol. 41, pp. 335–362, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Brin and L. Page, The Anatomy of a Large-Scale Hypertextual Web Search Engine, Proc. WWW7, 1998.

    Google Scholar 

  7. P. Eades, A heuristics for graph drawing, Congressus Numeranitium, Vol.42, pp. 149–160, 1984.

    MathSciNet  Google Scholar 

  8. S. Hirokawa and T. Taguchi, KN on ZK — Knowledge Network on Network Notepad ZK, Proc. the 1st International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1532, Springer-Verlag, pp. 411–412, 1998.

    Google Scholar 

  9. S. Hirokawa and D. Ikeda, Structural Analysis of Web Graph (in Japanese), Journal of Japanese Society for Artificial Intelligence, Vol. 16, No. 4, pp. 625–629, 2001.

    Google Scholar 

  10. D. Ikeda, Characteristic Sets of Strings Common to Semi-Structured Documents, Proc. the 2nd International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1721, Springer-Verlag, pp. 139–147, 1999.

    Google Scholar 

  11. D. Ikeda, T. Taguchi and S. Hirokawa, Developing a Knowledge Network of URLs, Proc. the 2nd International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1721, Springer-Verlag, pp. 328–329, 1999.

    Google Scholar 

  12. J. M. Kleinberg, Authoritative Sources in a Hyperlinked Environment, Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 668–677, 1998.

    Google Scholar 

  13. S. R. Kumar, S. Rajagopalan and A. Tomkins, Extracting large-scale knowledge bases from the web, Proc. 25th International Conference on Very Large Databases, 1999.

    Google Scholar 

  14. Lawrence, S., and Giles, C. L.: Accessibility of information on the Web, Nature, Vol.400, 107–109, (1999)

    Article  Google Scholar 

  15. Matsumura, N., Ohsawa, Y., and Ishizuka, M.: Discovery of Emerging Topics between Communities on WWW, Proc. Web Intelligence, Lecture Notes in Artificial Intelligence 2198 (to appear).

    Google Scholar 

  16. T. Minami, H. Sazuka, S. Hirokawa and T. Ohtani, Living with ZK — An Approach towards Communication with Analogue Messages, Proc. 2nd International Conference on Knowledge-based Intelligent Electronic Systems, pp. 369–374, 1998.

    Google Scholar 

  17. A. Quigley and P. Eades, FADE: Graph Drawing, Clustering and Visual Abstraction, Proc. Graph Drawing 2000, Lecture Notes in Computer Science 1984, Springer-Verlag, pp. 197–210, 2001.

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing and Communications Center, Kyushu University, 812-8581, Fukuoka, Japan

    Sachio Hirokawa & Daisuke Ikeda

Authors
  1. Sachio Hirokawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daisuke Ikeda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, 6-10-1 Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Setsuo Arikawa  & Ayumi Shinohara  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Hirokawa, S., Ikeda, D. (2002). Visualization and Analysis of Web Graphs. In: Arikawa, S., Shinohara, A. (eds) Progress in Discovery Science. Lecture Notes in Computer Science(), vol 2281. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45884-0_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-45884-0_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43338-5

  • Online ISBN: 978-3-540-45884-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation