We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Data Science & Analytics/Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings
PeriodicalsData Science & Analytics

Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings

Checking your access to this record.

Abstract & Overview

The analysis of ranking data has recently received increasing attention in many fields (i.e. political sciences, computer sciences, social sciences, medical sciences, etc.).Typically when dealing with preference rankings one of the main issue is to find a ranking that best represents the set of input rankings.Among several measures of agreement proposed in the literature, the Kendall's distance is probably the most known. We propose a branch-and-bound algorithm to find the solution(s) even when we take into account a relatively large number of objects to be ranked. We also propose a heuristic variant of the branch-and-bound algorithm useful when the number of objects to rank is particularly high. We show how the solution(s) achieved by the algorithm can be employed in different analysis of rank data such as Mallow's phi model, mixtures of distance-based models, cluster analysis and so on.

Cite this record

Antonio D’Ambrosio, Sonia Amodio, Carmela Iorio (2015). Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings. Electronic journal of applied statistical analysis, 8(2), 198–213. https://doi.org/10.1285/i20705948v8n2p198

Copy in another style

D’Ambrosio, A., Amodio, S., & Iorio, C. (2015). Two algorithms for finding optimal solutions of the Kemeny rank aggregation problem for full rankings. Electronic journal of applied statistical analysis, 8(2), 198–213. https://doi.org/10.1285/i20705948v8n2p198
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.