Choose the damping, choose the ranking?
type: Item
instance of: scholarly article
title: Choose the damping, choose the ranking?
zbMATH Open document ID: 1214.05160
author: Marco Bressan
author: Enoch Peserico
published in: Journal of Discrete Algorithms
publication date: 2010-05-25T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5711885
zbMATH Keywords: graph
zbMATH Keywords: ranking
zbMATH Keywords: link analysis
zbMATH Keywords: pagerank
zbMATH Keywords: damping factor
zbMATH Keywords: web
zbMATH Keywords: citeseer
describes a project that uses: WebGraph
MaRDI profile type: Publication
full work available at URL: j.jda.2009.11.001
OpenAlex ID: W2046264398
cites work: A Singular Perturbation Approach for Choosing the PageRank Damping Factor
cites work: Q4415288
cites work: Generic Damping Functions for Propagating Importance in Link-Based Ranking
cites work: Paradoxical Effects in PageRank Incremental Computations
cites work: Q4471270
cites work: Authoritative sources in a hyperlinked environment
cites work: Q5585021
cites work: Deeper Inside PageRank
cites work: Q5491464
cites work: HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
cites work: Q4871634
cites work: Ordinal Ranking for Google's PageRank
DOI: 10.1016/J.JDA.2009.11.001
description: scientific article; zbMATH DE number 5711885