Approximate rank aggregation (preliminary version)
From MaRDI portal
Recommendations
Cited in
(16)- Rank aggregation: new bounds for MCx
- Iterative ranking aggregation using quality improvement of subgroup ranking
- Approximate and dynamic rank aggregation
- Optimizing positional scoring rules for rank aggregation
- Rank aggregation using latent-scale distance-based models
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- An algorithm for rank aggregation problem
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Approximation algorithms for diversified search ranking
- Using balanced iterative reducing and clustering hierarchies to compute approximate rank statistics on massive datasets
- Rank aggregation: together we're strong
- scientific article; zbMATH DE number 2200791 (Why is no real title available?)
- HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
- Approximate Condorcet partitioning: solving large-scale rank aggregation problems
- A note on generalized rank aggregation
This page was built for publication: Approximate rank aggregation (preliminary version)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082934)