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.
Origine | Fichiers produits par l'(les) auteur(s) |
---|