Statistical ranking using the \(\ell^{1}\)-norm on graphs
From MaRDI portal
Publication:371094
DOI10.3934/ipi.2013.7.907zbMath1319.62047OpenAlexW2332835381MaRDI QIDQ371094
Jérôme Darbon, Braxton Osting, Stanley J. Osher
Publication date: 27 September 2013
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/ipi.2013.7.907
rank aggregation\(\ell^{1}\)-norm minimizationgraph-cut methodHodgeRankKemeny-Snell orderingstatistical ranking
Iterative numerical methods for linear systems (65F10) Graph algorithms (graph-theoretic aspects) (05C85) Statistical ranking and selection procedures (62F07) Discrete potential theory (31C20) Directed graphs (digraphs), tournaments (05C20)
Related Items
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance, Hodge Laplacians on Graphs, Analysis of crowdsourced sampling strategies for HodgeRank with sparse random graphs, Evaluating visual properties via robust HodgeRank, Non-Local Retinex---A Unifying Framework and Beyond
