Modelling the navigation potential of a web page

被引:2
作者
Fenner, Trevor [1 ]
Levene, Mark [1 ]
Loizou, George [1 ]
机构
[1] Univ London Birkbeck Coll, London WC1E 7HX, England
关键词
web graph; web navigation; link analysis metrics;
D O I
10.1016/j.tcs.2008.01.026
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:88 / 96
页数:9
相关论文
共 20 条
[1]  
Abramowitz M., 1972, HDB MATH FUNCTIONS F
[2]  
[Anonymous], 1994, Concrete Mathematics: a Foundation for Computer Science
[3]  
Baeza-Yates R., 2006, Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P308, DOI 10.1145/1148170.1148225
[4]   A Survey on PageRank Computing [J].
Berkhin, Pavel .
INTERNET MATHEMATICS, 2005, 2 (01) :73-120
[5]  
Bianchini M., 2005, ACM Transactions on Internet Technology, V5, P92, DOI 10.1145/1052934.1052938
[6]  
Dill S., 2002, ACM Trans. Internet Technol., V2, P205, DOI DOI 10.1145/572326.572328
[7]   CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION [J].
FREEMAN, LC .
SOCIAL NETWORKS, 1979, 1 (03) :215-239
[8]  
FROBERG CE, 1965, INTRO NUMERICAL ANAL
[9]  
Harary F., 1990, Distance in Graphs
[10]   Strong regularities in World Wide Web surfing [J].
Huberman, BA ;
Pirolli, PLT ;
Pitkow, JE ;
Lukose, RM .
SCIENCE, 1998, 280 (5360) :95-97