A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution

DOI10.1016/J.INS.2015.09.003zbMath1390.68517arXiv1401.0702OpenAlexW1752655734WikidataQ58041506 ScholiaQ58041506MaRDI QIDQ1750526

Piergiulio Tempesta, Massimo Cafaro, Marco Pulimeno

Publication date: 22 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.0702

zbMATH Keywords

message-passingfrequent itemsspace saving algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Related Items (2)

Fast and accurate mining of correlated heavy hitters ⋮ Distributed mining of time-faded heavy hitters

Cites Work

• Finding repeated elements
• The Parallel Evaluation of General Arithmetic Expressions
• An improved data stream summary: the count-min sketch and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution