Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Computing the Consensus Permutation in Mallows Distribution by Using Genetic Algorithms
verfasst von : Juan A. Aledo, Jose A. Gámez, David Molina
Erschienen in: Recent Trends in Applied Artificial Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose the use of a genetic algorithm in order to solve the rank aggregation problem, which consists in, given a dataset of rankings (or permutations) of
n
objects, finding the ranking which best
represents
such dataset. Though different probabilistic models have been proposed to tackle this problem (see e.g. [12]), the so called
Mallows model
is the one that has more attentions [1]. Exact computation of the parameters of this model is an NP-hard problem [19], justifies the use of metaheuristic algorithms for its resolution. In particular, we propose a genetic algorithm for solving this problem and show that, in most cases (specially in the most complex ones) we get statistically significant better results than the ones obtained by the state of the art algorithms.