Rank Aggregation for Non-stationary Data Streams - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2021

Rank Aggregation for Non-stationary Data Streams

Résumé

The problem of learning over non-stationary ranking streams arises naturally, particularly in recommender systems. The rankings represent the preferences of a population, and the non-stationarity means that the distribution of preferences changes over time. We propose an algorithm that learns the current distribution of ranking in an online manner. The bottleneck of this process is a rank aggregation problem. We propose a generalization of the Borda algorithm for non-stationary ranking streams. As a main result, we bound the minimum number of samples required to output the ground truth with high probability. Besides, we show how the optimal parameters are set. Then, we generalize the whole family of weighted voting rules (the family to which Borda belongs) to situations in which some rankings are more reliable than others. We show that, under mild assumptions, this generalization can solve the problem of rank aggregation over non-stationary data streams.
Fichier principal
Vignette du fichier
ranking_streams__concept_drift_and_uBorda (2).pdf (976.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03353591 , version 1 (24-09-2021)

Identifiants

Citer

Ekhine Irurozki, Aritz Perez, Jesus Lobo, Javier del Ser. Rank Aggregation for Non-stationary Data Streams. Machine Learning and Knowledge Discovery in Databases. Research Track, pp.297-313, 2021, ⟨10.1007/978-3-030-86523-8_18⟩. ⟨hal-03353591⟩
32 Consultations
55 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More