The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Discovery of Emerging Topics between Communities on WWW
WI '01 Proceedings of the First Asia-Pacific Conference on Web Intelligence: Research and Development
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
KN on ZK - Knowledge Network on Network Note Pad ZK
DS '98 Proceedings of the First International Conference on Discovery Science
Characteristic Sets of Strings Common to Semi-structured Documents
DS '99 Proceedings of the Second International Conference on Discovery Science
Developing a Knowledge Network of URLs
DS '99 Proceedings of the Second International Conference on Discovery Science
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Hi-index | 0.00 |
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.