Abstract
One of the well known Web search algorithms is HITS by Kleinberg [9]. We analyze the stability of HITS, when and how much outputs of HITS depend on initial values chosen by the algorithm. More importantly, we proposed a model for a type of hyperlink structures, which have been frequently observed on the Web, and we prove that in the model a crucial technical assumption made in HITS is satisfied, and accordingly HITS works well.
Original language | English (US) |
---|---|
Pages (from-to) | 649-662 |
Number of pages | 14 |
Journal | International Journal of Foundations of Computer Science |
Volume | 15 |
Issue number | 4 |
DOIs | |
State | Published - 2004 |
ASJC Scopus subject areas
- Computer Science (miscellaneous)
Keywords
- Analysis of algorithms
- Web search algorithms