Algorithms for continuous top-k processing in social networks

Abdulhafiz Alkhouli (1) , Dan Vodislav (1) , Boris Borzic (1)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes

Information streams are mainly produced today by social networks, but current methods for continuous top-k processing of such streams are still limited to content-based similarity. We present the SANTA algorithm, able to handle also social network criteria and events, and report a preliminary comparison with an extension of a state-of-the-art algorithm.

Domaines: Réseaux sociaux et d'information [cs.SI]; Algorithme et structure de données [cs.DS]; Traitement des images [eess.IV]

Abdulhafiz Alkhouli, Dan Vodislav, Boris Borzic. Algorithms for continuous top-k processing in social networks. International Symposium on Web AlGorithms, Jun 2015, Deauville, France. ⟨hal-01171346⟩