Identifying frequent items in distributed data sets

DOI10.1007/S00607-012-0220-1zbMATH Open1314.68388OpenAlexW2019955245WikidataQ61717246 ScholiaQ61717246MaRDI QIDQ488300FDOQ488300

Authors: Jan Sacha, Alberto Montresor 

Publication date: 26 January 2015

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-012-0220-1

Recommendations

• Identifying frequent items in a network using gossip
• ProFID: practical frequent item set discovery in peer-to-peer networks
• Study on discovering frequent items algorithm for distributed data stream
• Finding frequent items in data streams
• scientific article; zbMATH DE number 2086663

zbMATH Keywords

aggregationfrequencyfrequent items discoverygossip-based algorithmsmost frequent items in large-scale distributed datasets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Distributed algorithms (68W15) Distributed systems (68M14)

Cites Work

• Finding frequent items in data streams
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient top-\(k\) query calculation in distributed networks
• Title not available (Why is that?)
• Identifying frequent items in a network using gossip

Cited In (6)

• ProFID: practical frequent item set discovery in peer-to-peer networks
• Distributed mining of time-faded heavy hitters
• Study of a discovery method for useful data items in distributed data streams
• Identifying frequent items in a network using gossip
• Study on discovering frequent items algorithm for distributed data stream
• A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network

Uses Software

• PeerSim

This page was built for publication: Identifying frequent items in distributed data sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488300)