Faster HodgeRank approximation algorithm for statistical ranking and user recommendation problems

DOI10.1007/978-3-031-87804-6_7MaRDI QIDQ7238091zbMATH OpenFDO

Authors Shelby Ferrier, Junyuan Lin, Guangpeng Ren

Publication date 5 May 2026

Full work available at URL https://doi.org/10.1007/978-3-031-87804-6_7

zbMATH Keywords

approximation algorithmleast squares problemstatistical rankingmultigrid algorithmHodgeRank algorithmrank-biased overlapuser recommendation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Statistical aspects of big data and data science (62R07) Artificial intelligence (68Txx)

Cites work

• 10.1162/1532443041827916
• A NEW MEASURE OF RANK CORRELATION
• An Approach for Quantifying Paired Comparisons and Rank Order
• An adaptive multigrid method based on path cover
• Evaluating visual properties via robust HodgeRank
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Global and uniform convergence of subspace correction methods for some convex optimization problems
• Hodge Laplacians on graphs
• Numerical analysis: Historical developments in the 20th century
• ON THE METHOD OF PAIRED COMPARISONS
• Ranking the Vertices of a Paired Comparison Digraph
• Solution of a Ranking Problem from Binary Comparisons
• Solving Graph Laplacians via Multilevel Sparsifiers
• Statistical ranking and combinatorial Hodge theory

This page was built for publication: Faster HodgeRank approximation algorithm for statistical ranking and user recommendation problems

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