Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Databases and Information Systems

PDF

2017

Approximate algorithms

Articles 1 - 1 of 1

Full-Text Articles in Computer Engineering

Discovering Newsworthy Themes From Sequenced Data: A Step Towards Computational Journalism, Qi Fan, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan Tan Jul 2017

Discovering Newsworthy Themes From Sequenced Data: A Step Towards Computational Journalism, Qi Fan, Yuchen Li, Dongxiang Zhang, Kian-Lee Tan Tan

Research Collection School Of Computing and Information Systems

Automatic discovery of newsworthy themes from sequenced data can relieve journalists from manually poring over a large amount of data in order to find interesting news. In this paper, we propose a novel k -Sketch query that aims to find k striking streaks to best summarize a subject. Our scoring function takes into account streak strikingness and streak coverage at the same time. We study the k -Sketch query processing in both offline and online scenarios, and propose various streak-level pruning techniques to find striking candidates. Among those candidates, we then develop approximate methods to discover the k most representative …