Privacy-Preserving Record Linkage for Cardinality Counting

01/09/2023
by   Nan Wu, et al.
0

Several applications require counting the number of distinct items in the data, which is known as the cardinality counting problem. Example applications include health applications such as rare disease patients counting for adequate awareness and funding, and counting the number of cases of a new disease for outbreak detection, marketing applications such as counting the visibility reached for a new product, and cybersecurity applications such as tracking the number of unique views of social media posts. The data needed for the counting is however often personal and sensitive, and need to be processed using privacy-preserving techniques. The quality of data in different databases, for example typos, errors and variations, poses additional challenges for accurate cardinality estimation. While privacy-preserving cardinality counting has gained much attention in the recent times and a few privacy-preserving algorithms have been developed for cardinality estimation, no work has so far been done on privacy-preserving cardinality counting using record linkage techniques with fuzzy matching and provable privacy guarantees. We propose a novel privacy-preserving record linkage algorithm using unsupervised clustering techniques to link and count the cardinality of individuals in multiple datasets without compromising their privacy or identity. In addition, existing Elbow methods to find the optimal number of clusters as the cardinality are far from accurate as they do not take into account the purity and completeness of generated clusters. We propose a novel method to find the optimal number of clusters in unsupervised learning. Our experimental results on real and synthetic datasets are highly promising in terms of significantly smaller error rate of less than 0.1 with a privacy budget ϵ = 1.0 compared to the state-of-the-art fuzzy matching and clustering method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/10/2022

Local Differentially Private Fuzzy Counting in Stream Data using Probabilistic Data Structure

Privacy-preserving estimation of counts of items in streaming data finds...
research
10/15/2019

Privacy Preserving Count Statistics

The ability to preserve user privacy and anonymity is important. One of ...
research
12/12/2022

Privacy-Preserving Record Linkage

Given several databases containing person-specific data held by differen...
research
11/29/2019

Incremental Clustering Techniques for Multi-Party Privacy-Preserving Record Linkage

Privacy-Preserving Record Linkage (PPRL) supports the integration of sen...
research
03/25/2020

Probabilistic Counters for Privacy Preserving Data Aggregation

Probabilistic counters are well known tools often used for space-efficie...
research
02/04/2023

Sketch-Flip-Merge: Mergeable Sketches for Private Distinct Counting

Data sketching is a critical tool for distinct counting, enabling multis...
research
11/20/2020

HyperLogLog (HLL) Security: Inflating Cardinality Estimates

Counting the number of distinct elements on a set is needed in many appl...

Please sign up or login with your details

Forgot password? Click here to reset