Abstract

Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first effective means for search engines to cope with the explosive growth and diversification of the Web. We show that layouts for effective visualization of an underlying link structure can be computed in sync with the iterative computation utilized in all popular such rankings. Our visualizations provide valuable insight into the link structure and the ranking mechanism alike. Therefore, they are useful for the analysis of query results, maintenance of search engines, and evaluation of Web graph models.

Highlights

  • The directed graph induced by the hyperlink structure of the Web has been recognized as a rich source of information

  • To facilitate visual exploration of ranking methods on larger link structures such as Web graphs, we propose to apply the same principle, but with a very different layout algorithm that is more appropriate for the specific type of data

  • As a generalization of using indegrees to measure ‘status’ in social networks, the prominence of a vertex is determined by the number of directed paths of arbitrary length ending in the vertex, where the influence of longer paths is attenuated by a decay factor

Read more

Summary

Introduction

The directed graph induced by the hyperlink structure of the Web has been recognized as a rich source of information. While graph visualization is an active area of research as well [14, 28], its integration with quantitative network analyses is only beginning to receive attention It is, rather difficult to understand the determinants of, say, a particular ranking if its results do not influence the way in which the structure is visualized. To facilitate visual exploration of ranking methods on larger link structures such as Web graphs, we propose to apply the same principle, but with a very different layout algorithm that is more appropriate for the specific type of data. By using the axis separation principle and spectral layout techniques, a uniform approach to visual ranking of link structures is achieved.

Preliminaries
Structural Ranking of Web Resources
Hubs and authorities
PageRank
Katz’s status index
Spectral Graph Layout
Layout with eigenvectors
Computing the layout
Application Examples
Web graph models
Search engine query results
Bibliographic networks
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.