A randomized approximation algorithm for computing bucket orders

DOI10.1016/j.ipl.2008.12.003zbMath1191.68874OpenAlexW2158856152MaRDI QIDQ976119

Antti Ukkonen, Kai Puolamäki, Aristides Gionis, Heikki Mannila

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.003

zbMATH Keywords

rankingapproximation algorithmsrandomized algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (9)

Complexity reduction and approximation of multidomain systems of partially ordered data ⋮ Median constrained bucket order rank aggregation ⋮ Detecting and ordering salient regions ⋮ Approaching the rank aggregation problem by local search-based metaheuristics ⋮ Multi-dimensional Bayesian network classifiers for partial label ranking ⋮ Ensemble learning for the partial label ranking problem ⋮ Using extension sets to aggregate partial rankings in a flexible setting ⋮ A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach ⋮ Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem

Cites Work

• Aggregating inconsistent information
• Ordering by weighted number of wins gives a good ranking for weighted tournaments
• Unnamed Item
• Unnamed Item

This page was built for publication: A randomized approximation algorithm for computing bucket orders