The analysis of preference rankings has become an important topic in the general field of data analysis in recent years. The classic meaning of preference rankings understood as orders expressed by a series of judges have been joined by the concept of judges is no longer always understood as human beings, but as resulting from automatic evaluation procedures. This paper provides a particle swarm-based optimization algorithm that provides an accurate solution to the rank aggregation problem, namely producing a ranking that best synthesizes the orderings stated by each judge, when the number of items to be evaluated is large
A new accurate heuristics algorithm to solve the Rank Aggregation problem with a large number of objects
Romano, Maurizio
Primo
;
2023-01-01
Abstract
The analysis of preference rankings has become an important topic in the general field of data analysis in recent years. The classic meaning of preference rankings understood as orders expressed by a series of judges have been joined by the concept of judges is no longer always understood as human beings, but as resulting from automatic evaluation procedures. This paper provides a particle swarm-based optimization algorithm that provides an accurate solution to the rank aggregation problem, namely producing a ranking that best synthesizes the orderings stated by each judge, when the number of items to be evaluated is large
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
