Privacy-preserving data cube for electronic medical records: An experimental evaluation

被引:22
作者
Kim, Soohyung [1 ]
Lee, Hyukki [2 ]
Chung, Yon Dohn [2 ]
机构
[1] Korea Univ, Dept IT Convergence, Seoul, South Korea
[2] Korea Univ, Dept Comp Sci & Engn, Seoul, South Korea
基金
新加坡国家研究基金会;
关键词
Electronic medical records; Data cube; Medical privacy; Anonymization; K-ANONYMITY; ANONYMIZATION;
D O I
10.1016/j.ijmedinf.2016.09.008
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Introduction: The aim of this study is to evaluate the effectiveness and efficiency of privacy-preserving data cubes of electronic medical records (EMRs). An EMR data cube is a complex of EMR statistics that are summarized or aggregated by all possible combinations of attributes. Data cubes are widely utilized for efficient big data analysis and also have great potential for EMR analysis. For safe data analysis without privacy breaches, we must consider the privacy preservation characteristics of the EMR data cube. In this paper, we introduce a design for a privacy-preserving EMR data cube and the anonymization methods needed to achieve data privacy. We further focus on changes in efficiency and effectiveness that are caused by the anonymization process for privacy preservation. Thus, we experimentally evaluate various types of privacy-preserving EMR data cubes using several practical metrics and discuss the applicability of each anonymization method with consideration for the EMR analysis environment. Methods: We construct privacy-preserving EMR data cubes from anonymized EMR datasets. A real EMR dataset and demographic dataset are used for the evaluation. There are a large number of anonymization methods to preserve EMR privacy, and the methods are classified into three categories (i.e., global generalization, local generalization, and bucketization) by anonymization rules. According to this classification, three types of privacy-preserving EMR data cubes were constructed for the evaluation. We perform a comparative analysis by measuring the data size, cell overlap, and information loss of the EMR data cubes. Results: Global generalization considerably reduced the size of the EMR data cube and did not cause the data cube cells to overlap, but incurred a large amount of information loss. Local generalization maintained the data size and generated only moderate information loss, but there were cell overlaps that could decrease the search performance. Bucketization did not cause cells to overlap and generated little information loss; however, the method considerably inflated the size of the EMR data cubes. Conclusions: The utility of anonymized EMR data cubes varies widely according to the anonymization method, and the applicability of the anonymization method depends on the features of the EMR analysis environment. The findings help to adopt the optimal anonymization method considering the EMR analysis environment and goal of the EMR analysis. (C) 2016 Elsevier Ireland Ltd. All rights reserved.
引用
收藏
页码:33 / 42
页数:10
相关论文
共 36 条
  • [1] Aggarwal Charu C, 2008, A general survey of privacy-preserving data mining models and algorithms
  • [2] Aggarwal Gagan., 2006, PODS, P153, DOI DOI 10.1145/1142351.1142374
  • [3] [Anonymous], 2006, P 32 INT C VER LARG
  • [4] [Anonymous], 2005, P 2005 ACM SIGMOD IN
  • [5] [Anonymous], 2005, VLDB, DOI DOI 10.5555/1083592.1083696
  • [6] Bayardo RJ, 2005, PROC INT CONF DATA, P217
  • [7] Byun JW, 2007, LECT NOTES COMPUT SC, V4443, P188
  • [8] El Emam K., 2013, Anonymizing Health Data Case Studies and Methods to Get You Started
  • [9] Protecting privacy using k-anonymity
    El Emam, Khaled
    Dankar, Fida Kamal
    [J]. JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2008, 15 (05) : 627 - 637
  • [10] A Globally Optimal k-Anonymity Method for the De-Identification of Health Data
    El Emam, Khaled
    Dankar, Fida Kamal
    Issa, Romeo
    Jonker, Elizabeth
    Amyot, Daniel
    Cogo, Elise
    Corriveau, Jean-Pierre
    Walker, Mark
    Chowdhury, Sadrul
    Vaillancourt, Regis
    Roffey, Tyson
    Bottomley, Jim
    [J]. JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION, 2009, 16 (05) : 670 - 682