Rank aggregation for non-stationary data streams

no code implementations • 19 Oct 2019 • Ekhine Irurozki, Jesus Lobo, Aritz Perez, Javier Del Ser

Then, we generalize the whole family of weighted voting rules (the family to which Borda belongs) to situations in which some rankings are more \textit{reliable} than others and show that this generalization can solve the problem of rank aggregation over non-stationary data streams.

Recommendation Systems