Tackling the rank aggregation problem with evolutionary algorithms

DOI10.1016/j.amc.2013.07.081zbMath1346.68151OpenAlexW2025887164MaRDI QIDQ907462

David Molina, Juan A. Aledo, José A. Gámez

Publication date: 25 January 2016

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.07.081

zbMATH Keywords

genetic algorithmsrank aggregationMallows modelKemeny ranking problemKendall distance

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Statistical ranking and selection procedures (62F07)

Related Items

An agglomerative hierarchical clustering algorithm for linear ordinal rankings, A generalized Mallows model based on \(\phi\)-divergence measures, Partial evaluation in rank aggregation problems, A data-driven matching algorithm for ride pooling problem, Median constrained bucket order rank aggregation, Approaching the rank aggregation problem by local search-based metaheuristics, Computing kemeny rankings from \(d\)-Euclidean preferences, Using extension sets to aggregate partial rankings in a flexible setting, Rank aggregation in cyclic sequences, A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach, Unnamed Item, Approaching rank aggregation problems by using evolution strategies: the case of the optimal bucket order problem, Rank aggregation using latent-scale distance-based models