| TR#: | CS-2001-22 |
| Class: | CS |
| Title: | Rank-Stability and Rank-Similarity of Web Link-Based Ranking Algorithms |
| Authors: | Ronny Lempel and Shlomo Moran |
| PostScript | CS-2001-22.ps.gz - CS-2001-22.ps |
| CS-2001-22.pdf | |
| PS - Revised | CS-2001-22.revised.ps.gz - CS-2001-22.revised.ps |
| PDF - Revised | CS-2001-22.revised.pdf |
| Abstract: | The stability of Web link-based ranking algorithms was examined in recent works. Among the aspects investigated were the notions of rank stable algorithms and rank similar algorithms. Of special interest are stability results on a particular class of graphs, called authority connected graphs. This report considers three link-based ranking algorithms: PageRank, HITS and SALSA. We extend previous results by proving that neither HITS nor PageRank is rank stable on the class of authority connected graphs. We then show that HITS and PageRank are not rank similar on this class, nor is any of them rank similar to SALSA. |
| Copyright | The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information |
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2001/CS/CS-2001-22), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2001
To the main CS technical reports page