Skip to Main content Skip to Navigation
Conference papers

Algorithms for continuous top-k processing in social networks

Abstract : 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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01171346
Contributor : Thomas Largillier Connect in order to contact the contributor
Submitted on : Friday, July 3, 2015 - 2:15:59 PM
Last modification on : Friday, August 5, 2022 - 2:46:00 PM
Long-term archiving on: : Tuesday, April 25, 2017 - 11:15:37 PM

File

poster8.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01171346, version 1

Citation

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⟩

Share

Metrics

Record views

115

Files downloads

94