ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1601.05495
  4. Cited By
Data-driven Rank Breaking for Efficient Rank Aggregation

Data-driven Rank Breaking for Efficient Rank Aggregation

21 January 2016
A. Khetan
Sewoong Oh
    FedML
ArXivPDFHTML

Papers citing "Data-driven Rank Breaking for Efficient Rank Aggregation"

6 / 6 papers shown
Title
Simple, Robust and Optimal Ranking from Pairwise Comparisons
Simple, Robust and Optimal Ranking from Pairwise Comparisons
Nihar B. Shah
Martin J. Wainwright
396
175
0
30 Dec 2015
Stochastically Transitive Models for Pairwise Comparisons: Statistical
  and Computational Issues
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
Nihar B. Shah
Sivaraman Balakrishnan
Adityanand Guntuboyina
Martin J. Wainwright
170
147
0
19 Oct 2015
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology
  Dependence
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
Nihar B. Shah
Sivaraman Balakrishnan
Joseph K. Bradley
Abhay K. Parekh
Kannan Ramchandran
Martin J. Wainwright
165
164
0
06 May 2015
Minimax-optimal Inference from Partial Rankings
Minimax-optimal Inference from Partial Rankings
Bruce Hajek
Sewoong Oh
Jiaming Xu
163
96
0
21 Jun 2014
Rank Centrality: Ranking from Pair-wise Comparisons
Rank Centrality: Ranking from Pair-wise Comparisons
S. Negahban
Sewoong Oh
Devavrat Shah
142
223
0
08 Sep 2012
Active Ranking using Pairwise Comparisons
Active Ranking using Pairwise Comparisons
Kevin Jamieson
Robert D. Nowak
196
253
0
16 Sep 2011
1