Mining frequent items in unstructured P2P networks

06/18/2018
by   Massimo Cafaro, et al.
0

Large scale decentralized systems, such as P2P, sensor or IoT device networks are becoming increasingly common, and require robust protocols to address the challenges posed by the distribution of data and the large number of peers belonging to the network. In this paper, we deal with the problem of mining frequent items in unstructured P2P networks. This problem, of practical importance, has many useful applications. We design P2PSS, a fully decentralized, gossip--based protocol for frequent items discovery, leveraging the Space-Saving algorithm. We formally prove the correctness and theoretical error bound. Extensive experimental results clearly show that P2PSS provides very good accuracy and scalability. To the best of our knowledge, this is the first gossip--based distributed algorithm providing strong theoretical guarantees for both the Approximate Frequent Items Problem and for the frequency estimation of discovered frequent items.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2018

Distributed mining of time--faded heavy hitters

We present P2PTFHH (Peer--to--Peer Time--Faded Heavy Hitters) which, to ...
research
12/07/2021

SpaceSaving^±: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model

In this paper, we propose the first deterministic algorithms to solve th...
research
09/03/2022

LDP-FPMiner: FP-Tree Based Frequent Itemset Mining with Local Differential Privacy

Data aggregation in the setting of local differential privacy (LDP) guar...
research
12/28/2018

Parallel Algorithm for Frequent Itemset Mining on Intel Many-core Systems

Frequent itemset mining leads to the discovery of associations and corre...
research
03/29/2018

Frequent Item-set Mining without Ubiquitous Items

Frequent Item-set Mining (FIM), sometimes called Market Basket Analysis ...
research
02/21/2019

Performance study of distributed Apriori-like frequent itemsets mining

In this article, we focus on distributed Apriori-based frequent itemsets...
research
01/07/2013

Finding the True Frequent Itemsets

Frequent Itemsets (FIs) mining is a fundamental primitive in data mining...

Please sign up or login with your details

Forgot password? Click here to reset