Private Frequent Itemset Mining in the Local Setting

被引:2
|
作者
Fu, Hang [1 ]
Yang, Wei [1 ]
Huang, Liusheng [1 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei, Peoples R China
来源
WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT II | 2021年 / 12938卷
关键词
Local differential privacy; Frequent itemset mining; Crowdsensing; Randomized response;
D O I
10.1007/978-3-030-86130-8_27
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Set-valued data, which is useful for representing user-generated data, becomes ubiquitous in numerous online services. Service provider profits by learning patterns and associations from users' set-valued data. However, it comes with privacy concerns if these data are collected from users directly. This work studies frequent itemset mining from user-generated set-valued datameanwhile locally preserving personal data privacy. Under local d-privacy constraints, which capture intrinsic dissimilarity between set-valued data in the framework of differential privacy, we propose a novel privacy-preserving frequent itemset mining mechanism, called PrivFIM. It provides rigorous data privacy protection on the user-side and allows effective statistical analyses on the server-side. Specifically, each user perturbs his set-valued data locally to guarantee that the server cannot infer the user's original itemset with high confidence. The server can reconstruct an unbiased estimation of itemset frequency from these randomized data and then combines it with the Apriori-based pruning technique to identify frequent itemsets efficiently and accurately. Extensive experiments conducted on real-world and synthetic datasets demonstrate that PrivFIM surpasses existing methods, and maintains high utility while providing strong privacy guarantees.
引用
收藏
页码:338 / 350
页数:13
相关论文
共 50 条
  • [21] Frequent Itemset Mining as Set Intersection Problem
    Stanisic, Predrag
    Tomovic, Savo
    2013 2ND MEDITERRANEAN CONFERENCE ON EMBEDDED COMPUTING (MECO), 2013,
  • [22] Pushing Convertible Constraints in Frequent Itemset Mining
    Jian Pei
    Jiawei Han
    Laks V.S. Lakshmanan
    Data Mining and Knowledge Discovery, 2004, 8 : 227 - 252
  • [23] A Generalized Parallel Algorithm for Frequent Itemset Mining
    Craus, Mitica
    Archip, Alexandru
    PROCEEDINGS OF THE 12TH WSEAS INTERNATIONAL CONFERENCE ON COMPUTERS , PTS 1-3: NEW ASPECTS OF COMPUTERS, 2008, : 520 - +
  • [24] Frequent Itemset Mining Algorithms :A Literature Survey
    Jamsheela, O.
    Raju, G.
    2015 IEEE INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC), 2015, : 1099 - 1104
  • [25] DP-Apriori: A differentially private frequent itemset mining algorithm based on transaction splitting
    Cheng, Xiang
    Su, Sen
    Xu, Shengzhi
    Li, Zhengyi
    COMPUTERS & SECURITY, 2015, 50 : 74 - 90
  • [26] An Incremental Algorithm for Frequent Itemset Mining on Spark
    Yu, Min
    Zuo, Chuang
    Yuan, Yunpeng
    Yang, Yulu
    2017 IEEE 2ND INTERNATIONAL CONFERENCE ON BIG DATA ANALYSIS (ICBDA), 2017, : 281 - 285
  • [27] BISC: A Bitmap Itemset Support Counting Approach for Efficient Frequent Itemset Mining
    Chen, Jinlin
    Xiao, Keli
    ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2010, 4 (03)
  • [28] Accelerating Intersection Computation in Frequent Itemset Mining with FPGA
    Shi, Shaobo
    Qi, Yue
    Wang, Qin
    2013 IEEE 15TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS & 2013 IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (HPCC_EUC), 2013, : 659 - 665
  • [29] Accelerating frequent itemset mining on graphics processing units
    Fan Zhang
    Yan Zhang
    Jason D. Bakos
    The Journal of Supercomputing, 2013, 66 : 94 - 117
  • [30] Anytime Frequent Itemset Mining of Transactional Data Streams
    Goyal, Poonam
    Challa, Jagat Sesh
    Shrivastava, Shivin
    Goyal, Navneet
    BIG DATA RESEARCH, 2020, 21