Continuous Summarization over Microblog Threads

Song, Liangjun; Zhang, Ping; Bao, Zhifeng; Sellis, Timos

doi:10.1007/978-3-319-55699-4_31

Cited by 1 publication

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Social Stream Summarization. There have been extensive studies on social stream summarization [1,4,23,25,26,27,29,36] : the problem of extracting a set of representative elements from social streams. Shou et al [27,36] propose a framework for social stream summarization based on dynamic clustering.…”

Section: Related Workmentioning

confidence: 99%

Semantic and Influence aware k-Representative Queries over Social Streams

Wang,

Li,

Tan

2019

Preprint

View full text Add to dashboard Cite

Massive volumes of data continuously generated on social platforms have become an important information source for users. A primary method to obtain fresh and valuable information from social streams is social search. Although there have been extensive studies on social search, existing methods only focus on the relevance of query results but ignore the representativeness. In this paper, we propose a novel Semantic and Influence aware k-Representative (k-SIR) query for social streams based on topic modeling. Specifically, we consider that both user queries and elements are represented as vectors in the topic space. A k-SIR query retrieves a set of k elements with the maximum representativeness over the sliding window at query time w.r.t. the query vector. The representativeness of an element set comprises both semantic and influence scores computed by the topic model. Subsequently, we design two approximation algorithms, namely MULTI-TOPIC THRESHOLDSTREAM (MTTS) and MULTI-TOPIC THRESHOLDDESCEND (MTTD), to process k-SIR queries in real-time. Both algorithms leverage the ranked lists maintained on each topic for k-SIR processing with theoretical guarantees. Extensive experiments on real-world datasets demonstrate the effectiveness of k-SIR query compared with existing methods as well as the efficiency and scalability of our proposed algorithms for k-SIR processing.

show abstract