Algorithms for continuous top-k processing in social networks - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

Algorithms for continuous top-k processing in social networks

Résumé

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.
Fichier principal
Vignette du fichier
poster8.pdf (249.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01171346 , version 1 (03-07-2015)

Identifiants

  • HAL Id : hal-01171346 , version 1

Citer

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⟩
130 Consultations
109 Téléchargements

Partager

More