Link Analysis, Eigenvectors and Stability
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 903-909.
Abstract
The HITS and the PageRank algorithms are eigenvector methods for identifying “authoritative” or “influential” articles, given hyperlink or citation information. That such algorithms should give consistent answers is surely a desideratum, and in this paper, we address the question of when they can be expected to give stable rankings under small perturbations to the hyperlink patterns. Using tools from matrix perturbation theory and Markov chain theory, we provide conditions under which these methods are stable, and give specific examples of instability when these conditions are violated. We also briefly describe a modification to HITS that improves its stability.
@inproceedings{ijcai2001p124,
title = {Link Analysis, Eigenvectors and Stability},
author = {Ng, Andrew Y. and Zheng, Alice X. and Jordan, Michael I.},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {903--909},
year = {2001},
url = {https://ijcai.org/proceedings/2001/124},
}
TY - CPAPER TI - Link Analysis, Eigenvectors and Stability AU - Ng, Andrew Y. AU - Zheng, Alice X. AU - Jordan, Michael I. T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 903 EP - 909 UR - https://ijcai.org/proceedings/2001/124 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: