Link Evolution: Analysis and Algorithms

摘要: We anticipate that future web search techniques will exploit changes in structure and content. As a first step this direction, we examine the problem of integrating observed link into static hyperlink-based ranking computations. present very efficient algorithm to incrementally compute good approximations Google's PageRank [Brin Page 98], as links evolve. Our experiments reveal is both fast yields excellent PageRank, even light large structure. derives intuition partial justification from rigorous sensitivity analysis Markov chains. Consider regular chain with stationary probability π, suppose transition state j increased. prove can only cause • πj increase–adding site target increase; rank improve–if states are ordered according thei...