2001 StableAlgorithmsForLinkAnalysis

Jump to: navigation, search

Subject Headings: Link Analysis Algorithm.


Cited By



The Kleinberg HITS and the Google PageRank algorithms are eigenvector methods for identifyingauthoritative or “influential articles, given hyperlink or citation information. That such algorithms should give reliable or consistent answers is surely a desideratum, and in [10], we analyzed when they can be expected to give stable rankings under small perturbations to the linkage patterns. In this paper, we extend the analysis and show how it gives insight into ways of designing stable link analysis methods. This in turn motivates two new algorithms, whose performance we study empirically using citation data and web hyperlink data.



 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
2001 StableAlgorithmsForLinkAnalysisAndrew Y. Ng
Alice X. Zheng
Michael I. Jordan
Stable Algorithms for Link AnalysisProceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrievalhttp://www.robotics.stanford.edu/~ang/papers/sigir01-stablelinkanalysis.pdf10.1162/1532443027601852432001