Identifying frequent items in a network using gossip

DOI10.1016/J.JPDC.2010.07.006MaRDI QIDQ666263zbMATH OpenOpenAlexWikidataFDO

Authors Bibudh Lahiri, Srikanta Tirthapura

Publication date 7 March 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2010.07.006

zbMATH Keywords

sketchgossipfrequent items

Mathematics Subject Classification ID

Data structures (68P05) Distributed systems (68M14)

Recommendations

• Identifying frequent items in distributed data sets
• ProFID: practical frequent item set discovery in peer-to-peer networks
• Distributed mining of time-faded heavy hitters
• P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network
• In-network estimation of frequency moments

Cites work

• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• scientific article; zbMATH DE number 5454271 (Why is no real title available?)
• scientific article; zbMATH DE number 1775418 (Why is no real title available?)
• Computing separable functions via gossip
• Efficient top-\(k\) query calculation in distributed networks
• Finding repeated elements
• Geographic Gossip: Efficient Averaging for Sensor Networks
• Probability and Computing
• The shortest-path problem for graphs with random arc-lengths

Cited in

(6)

• ProFID: practical frequent item set discovery in peer-to-peer networks
• Distributed mining of time-faded heavy hitters
• P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network
• Distributed data summarization in well-connected networks
• Mining frequent items in data stream using time fading model
• Identifying frequent items in distributed data sets

This page was built for publication: Identifying frequent items in a network using gossip

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