Computational models of information scent-following in a very large browsable text collection
Proceedings of the ACM SIGCHI Conference on Human factors in computing systems
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Knowledge and Information Systems
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
ACM Transactions on Internet Technology (TOIT)
The Best Trail Algorithm for Assisted Navigation of Web Sites
LA-WEB '03 Proceedings of the First Conference on Latin American Web Congress
ACM Transactions on Internet Technology (TOIT)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Google's PageRank and Beyond: The Science of Search Engine Rankings
Google's PageRank and Beyond: The Science of Search Engine Rankings
Generalizing PageRank: damping functions for link-based ranking algorithms
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
An Introduction to Search Engines and Web Navigation
An Introduction to Search Engines and Web Navigation
Hi-index | 5.23 |
Navigating the web involves pruning (or discounting) some of the outgoing links and following one of the others. More pruning is likely to happen for deeper navigation. Under this model of navigation, we call the number of nodes that are available after pruning, for browsing within a session, the potential gain of the starting web page. We first consider the case when the discounting factor is geometric. We show that the distribution of the effective number of links that the user can follow at each navigation step after pruning, i.e. the number of nodes added to the potential gain at that step, is given by the erf function, which is related to the probability density function for the Normal distribution. We derive an approximation to the potential gain of a web page and show numerically that it is very accurate; we also obtain lower and upper bounds. We then consider a harmonic discounting factor and show that, in this case, the potential gain at each step is closely related to the probability density function for the Poisson distribution. The potential gain has been applied to web navigation where, given no other information, it helps the user to choose a good starting point for initiating a ''surfing'' session. Another application is in social network analysis, where the potential gain could provide a novel measure of centrality.