Differentially private frequent episode mining over event streams

被引:3
|
作者
Qin, Jiawen [1 ,2 ]
Wang, Jinyan [1 ,2 ]
Li, Qiyu [2 ]
Fang, Shijian [2 ]
Li, Xianxian [1 ,2 ]
Lei, Lei [3 ]
机构
[1] Guangxi Normal Univ, Guangxi Key Lab Multisource Informat Min & Secur, Guilin, Peoples R China
[2] Guangxi Normal Univ, Sch Comp Sci & Engn, Guilin, Peoples R China
[3] Guangxi Nanning Tianchengzhiyuan Intellectual Pro, Nanning, Peoples R China
基金
中国国家自然科学基金;
关键词
Differential privacy; Frequent episode; Event streams; Privacy preservation; Real-time data mining;
D O I
10.1016/j.engappai.2022.104681
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Frequent episode mining is a wide range framework of data mining from sequential data with many applications, which is a totally short-ordered collection of event-types and unearths temporal correlations without information loss over event streams. While offering substantial benefits, directly releasing frequent episodes to the public will enormously threaten the individual's privacy. However, there is little work so far concentrating on privately frequent episode mining. In this paper, we investigate the privacy problem in mining frequent episodes from event streams due to continuous releases in successive windows and propose a real-time differentially private frequent episode mining algorithm over event streams to avoid the privacy leakage with omega-event privacy guarantee. To obtain private frequent episodes, we propose a sample-based perturbation approach, which improves the accuracy of selecting frequent episodes based on sampling databases. To reduce the privately mining time and avoid repeatedly privacy budget allocation to coincident window of adjacent releases as much as possible, we present an incremental perturbation approach according to the judgment in dissimilarity calculation mechanism. Meanwhile, in order to protect data collected from any omega successive timestamps over event streams, we employ an adaptive omega-event privacy mechanism on the basis of the dynamicity of episodes. Finally, experimental results on real-world datasets demonstrate the effectiveness and efficiency of our algorithm.
引用
收藏
页数:16
相关论文
共 50 条
  • [41] Mining recent frequent itemsets in sliding windows over data streams
    Congying Han
    Lijun Xu
    Guoping He
    [J]. COMPUTING AND INFORMATICS, 2008, 27 (03) : 315 - 339
  • [42] Mining frequent patterns in an arbitrary sliding window over data streams
    Li, Guohui
    Chen, Hui
    Yang, Bing
    Chen, Gang
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2008, 4947 : 496 - 503
  • [43] Bloom Filter Based Frequent Patterns Mining over Data Streams
    Tan JunShan
    Kuang Zhufang
    Yang Guogui
    [J]. INTERNATIONAL CONFERENCE ON GRAPHIC AND IMAGE PROCESSING (ICGIP 2012), 2013, 8768
  • [44] Efficient algorithm for mining approximate frequent item over data streams
    Wang, Wei-Ping
    Li, Jian-Zhong
    Zhang, Dong-Dong
    Guo, Long-Jiang
    [J]. Ruan Jian Xue Bao/Journal of Software, 2007, 18 (04): : 884 - 892
  • [45] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Yu, Shao-jun
    [J]. 2011 SECOND INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND EDUCATION APPLICATION (ICEA 2011), 2011, : 197 - 201
  • [46] Efficient approximate mining of frequent patterns over transactional data streams
    Ng, Willie
    Dash, Manoranjan
    [J]. DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS, 2008, 5182 : 241 - 250
  • [47] An Efficient Approach for Mining Frequent Patterns over Uncertain Data Streams
    Shajib, Md. Badi-Uz-Zaman
    Samiullah, Md.
    Ahmed, Chowdhury Farhan
    Leung, Carson K.
    Pazdor, Adam G. M.
    [J]. 2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016), 2016, : 980 - 984
  • [48] Efficient algorithm for frequent pattern mining over uncertain data streams
    Du, Congqiang
    Shao, Zengzhen
    [J]. Journal of Computational Information Systems, 2015, 11 (21): : 7799 - 7808
  • [49] An Efficient Frequent Closed Itemsets Mining Algorithm Over Data Streams
    Tan, Jun
    Bu, Yingyong
    Yang, Bo
    [J]. 2009 INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING, VOL 3, PROCEEDINGS, 2009, : 65 - +
  • [50] Approximate mining of global closed frequent itemsets over data streams
    Guo, Lichao
    Su, Hongye
    Qu, Yu
    [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2011, 348 (06): : 1052 - 1081