Differentially private tree-based redescription mining

被引:1
|
作者
Mihelcic, Matej [1 ]
Miettinen, Pauli [2 ]
机构
[1] Univ Zagreb, Dept Math, Zagreb, Croatia
[2] Univ Eastern Finland, Sch Comp, Kuopio, Finland
关键词
Redescription mining; Differential privacy; Health care informatics; DATA PERTURBATION;
D O I
10.1007/s10618-023-00934-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Differential privacy provides a strong form of privacy and allows preserving most of the original characteristics of the dataset. Utilizing these benefits requires one to design specific differentially private data analysis algorithms. In this work, we present three tree-based algorithms for mining redescriptions while preserving differential privacy. Redescription mining is an exploratory data analysis method for finding connections between two views over the same entities, such as phenotypes and genotypes of medical patients, for example. It has applications in many fields, including some, like health care informatics, where privacy-preserving access to data is desired. Our algorithms are the first tree-based differentially private redescription mining algorithms, and we show via experiments that, despite the inherent noise in differential privacy, it can return trustworthy results even in smaller datasets where noise typically has a stronger effect.
引用
收藏
页码:1548 / 1590
页数:43
相关论文
共 50 条
  • [31] Differentially Private Frequent Sequence Mining
    Xu, Shengzhi
    Cheng, Xiang
    Su, Sen
    Xiao, Ke
    Xiong, Li
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (11) : 2910 - 2926
  • [32] A tree-based Mergesort
    Moffat, A
    Petersson, O
    Wormald, NC
    [J]. ACTA INFORMATICA, 1998, 35 (09) : 775 - 793
  • [33] A Tree-based Mergesort
    Alistair Moffat
    Ola Petersson
    Nicholas C. Wormald
    [J]. Acta Informatica, 1998, 35 : 775 - 793
  • [34] A Comparative Study of Tree-based and Apriori-based Approaches for Incremental Data Mining
    Kumar, Manoj
    Soni, Hemant Kumar
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING RESEARCH IN AFRICA, 2016, 23 (23) : 120 - 130
  • [35] Comparing performance of non–tree-based and tree-based association mapping methods
    Katherine L. Thompson
    David W. Fardo
    [J]. BMC Proceedings, 10 (Suppl 7)
  • [36] Differentially Private String Sanitization for Frequency-Based Mining Tasks
    Chen, Huiping
    Dong, Changyu
    Fan, Liyue
    Loukides, Grigorios
    Pissis, Solon P.
    Stougie, Leen
    [J]. 2021 21ST IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2021), 2021, : 41 - 50
  • [37] A tree-based data perturbation approach for privacy-preserving data mining
    IEEE Computer Society
    不详
    不详
    [J]. IEEE Trans Knowl Data Eng, 2006, 9 (1278-1283):
  • [38] A Differentially private hybrid decomposition algorithm based on quad-tree
    Li, Shuyu
    Geng, Yue
    Li, Yingle
    [J]. COMPUTERS & SECURITY, 2021, 109 (109)
  • [39] A tree-based data perturbation approach for privacy-preserving data mining
    Li, Xiao-Bai
    Sarkar, Sumit
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2006, 18 (09) : 1278 - 1283
  • [40] An Efficient Tree-Based Algorithm for Mining High Average-Utility Itemset
    Yildirim, Irfan
    Celik, Mete
    [J]. IEEE ACCESS, 2019, 7 : 144245 - 144263