HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank

DOI10.1007/978-3-642-02882-3_35MaRDI QIDQ5323083zbMATH OpenOpenAlexFDO

Authors Enoch Peserico, Luca Pretto

Publication date 23 July 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02882-3_35

zbMATH Keywords

HITS algorithmhubs and authoritieshyperlink-induced topic searchweighted graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11)

Recommendations

• HITS can converge slowly, but not too slowly, in score and rank
• Convergence of iterative scoring rules
• Approximate and dynamic rank aggregation
• Optimizing positional scoring rules for rank aggregation
• The convergence rate of a regularized ranking algorithm
• WEAK CONSISTENCY AND QUASI-LINEAR MEANS IMPLY THE ACTUAL RANKING
• Approximate rank aggregation (preliminary version)

Cites work

• ANALYSIS OF WEB SEARCH ALGORITHM HITS
• Authoritative sources in a hyperlinked environment
• Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization
• Google's PageRank and beyond. The science of search engine rankings
• HITS can converge slowly, but not too slowly, in score and rank
• scientific article; zbMATH DE number 2129108 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 2079318 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)

Cited in

(3)

• ANALYSIS OF WEB SEARCH ALGORITHM HITS
• HITS can converge slowly, but not too slowly, in score and rank
• Choose the damping, choose the ranking?

This page was built for publication: HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5323083)