A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network

DOI10.1002/sam.10033zbMath1166.62383OpenAlexW3083096183MaRDI QIDQ3497747

Souptik Datta, Hillol Kargupta

Publication date: 27 July 2009

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.10033

zbMATH Keywords

samplingdata miningpeer-to-peerfrequent item sets

Mathematics Subject Classification ID

Applications of statistics (62P99) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed systems (68M14)

Related Items

Randomized load balancing by joining and splitting bins ⋮ P2P-FISM: mining (recently) frequent item sets from distributed data streams over P2P network ⋮ Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems

Cites Work

• The price of validity in dynamic networks
• Emergence of Scaling in Random Networks
• Distributed Decision‐Tree Induction in Peer‐to‐Peer Systems
• Equation of State Calculations by Fast Computing Machines
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network