Distributed mining of time-faded heavy hitters
From MaRDI portal
Publication:2054052
DOI10.1016/j.ins.2020.09.048zbMath1475.68292arXiv1812.01450OpenAlexW3088162717MaRDI QIDQ2054052
Italo Epicoco, Massimo Cafaro, Marco Pulimeno
Publication date: 30 November 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01450
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifying frequent items in distributed data sets
- Mining frequent items in data stream using time fading model
- Identifying frequent items in a network using gossip
- Finding repeated elements
- Identifying correlated heavy-hitters in a two-dimensional data stream
- Fast and accurate mining of correlated heavy hitters
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
- An improved data stream summary: the count-min sketch and its applications
- ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks
This page was built for publication: Distributed mining of time-faded heavy hitters