Evaluating the Privacy Implications of Frequent Itemset Disclosure - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Evaluating the Privacy Implications of Frequent Itemset Disclosure

(1) , (2) , (1) , (1)
1
2
Jaideep Vaidya
  • Function : Author
  • PersonId : 996030

Abstract

Frequent itemset mining is a fundamental data analytics task. In many cases, due to privacy concerns, only the frequent itemsets are released instead of the underlying data. However, it is not clear how to evaluate the privacy implications of the disclosure of the frequent itemsets. Towards this, in this paper, we define the k-distant-IFM-solutions problem, which aims to find k transaction datasets whose pair distance is maximized. The degree of difference between the reconstructed datasets provides a way to evaluate the privacy risk. Since the problem is NP-hard, we propose a 2-approximate solution as well as faster heuristics, and evaluate them on real data.
Fichier principal
Vignette du fichier
449885_1_En_34_Chapter.pdf (530.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01649007 , version 1 (27-11-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Edoardo Serra, Jaideep Vaidya, Haritha Akella, Ashish Sharma. Evaluating the Privacy Implications of Frequent Itemset Disclosure. 32th IFIP International Conference on ICT Systems Security and Privacy Protection (SEC), May 2017, Rome, Italy. pp.506-519, ⟨10.1007/978-3-319-58469-0_34⟩. ⟨hal-01649007⟩
37 View
28 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More