ProFID: practical frequent item set discovery in peer-to-peer networks

DOI10.1007/978-90-481-9794-1_40zbMATH Open1198.68077OpenAlexW302057982MaRDI QIDQ4932704FDOQ4932704

Authors: Emrah Cem, Oznur Ozkasap 

Publication date: 6 October 2010

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-90-481-9794-1_40

Recommendations

• P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network
• A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network
• Identifying frequent items in distributed data sets
• Identifying frequent items in a network using gossip
• Distributed mining of time-faded heavy hitters

zbMATH Keywords

PeerSimunstructured P2P networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• ProFID: practical frequent item set discovery in peer-to-peer networks

Cited In (7)

• P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network
• ProFID: practical frequent item set discovery in peer-to-peer networks
• Distributed mining of time-faded heavy hitters
• Identifying frequent items in distributed data sets
• Identifying frequent items in a network using gossip
• Data mining in P2P networks
• A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network

This page was built for publication: ProFID: practical frequent item set discovery in peer-to-peer networks

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