Differentially Private K-Means Clustering Applied to Meter Data Analysis and Synthesis

被引:11
|
作者
Ravi, Nikhil [1 ]
Scaglione, Anna [1 ]
Kadam, Sachin [2 ,3 ]
Gentz, Reinhard [4 ,5 ]
Peisert, Sean [4 ]
Lunghino, Brent [6 ]
Levijarvi, Emmanuel [7 ]
Shumavon, Aram [8 ]
机构
[1] Cornell Tech, Dept Elect & Comp Engn, New York, NY 10044 USA
[2] Arizona State Univ, Sch Elect Comp & Energy Engn, Tempe, AZ 85281 USA
[3] Sungkyunkwan Univ, Suwon 16419, Gyeonggi, South Korea
[4] Lawrence Berkeley Natl Lab, Computat Res, Berkeley, CA 94720 USA
[5] Amazon, Networking Dept, Seattle, WA 98170 USA
[6] Kevala Inc, Data Sci & Methodol Implementat, San Francisco, CA 94133 USA
[7] Kevala Inc, Software Engn Dept, San Francisco, CA 94133 USA
[8] Kevala Inc, San Francisco, CA 94133 USA
关键词
Differential privacy; clustering; smart grids; summary statistics; synthetic load generation; NOISE;
D O I
10.1109/TSG.2022.3184252
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The proliferation of smart meters has resulted in a large amount of data being generated. It is increasingly apparent that methods are required for allowing a variety of stakeholders to leverage the data in a manner that preserves the privacy of the consumers. The sector is scrambling to define policies, such as the so called '15/15 rule', to respond to the need. However, the current policies fail to adequately guarantee privacy. In this paper, we address the problem of allowing third parties to apply K-means clustering, obtaining customer labels and centroids for a set of load time series by applying the framework of differential privacy. We leverage the method to design an algorithm that generates differentially private synthetic load data consistent with the labeled data. We test our algorithm's utility by answering summary statistics such as average daily load profiles for a 2-dimensional synthetic dataset and a real-world power load dataset.
引用
收藏
页码:4801 / 4814
页数:14
相关论文
共 50 条
  • [1] Differentially Private K-Means Clustering
    Su, Dong
    Cao, Jianneng
    Li, Ninghui
    Bertino, Elisa
    Jin, Hongxia
    CODASPY'16: PROCEEDINGS OF THE SIXTH ACM CONFERENCE ON DATA AND APPLICATION SECURITY AND PRIVACY, 2016, : 26 - 37
  • [2] Optimal Differentially Private Algorithms for k-Means Clustering
    Huang, Zhiyi
    Liu, Jinyan
    PODS'18: PROCEEDINGS OF THE 37TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2018, : 395 - 408
  • [3] A Convergent Differentially Private k-Means Clustering Algorithm
    Lu, Zhigang
    Shen, Hong
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2019, PT I, 2019, 11439 : 612 - 624
  • [4] Differentially Private k-Means Clustering With Convergence Guarantee
    Lu, Zhigang
    Shen, Hong
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (04) : 1541 - 1552
  • [5] Differentially Private K-Means Clustering and a Hybrid Approach to Private Optimization
    Su, Dong
    Cao, Jianneng
    Li, Ninghui
    Bertino, Elisa
    Lyu, Min
    Jin, Hongxia
    ACM TRANSACTIONS ON PRIVACY AND SECURITY, 2017, 20 (04)
  • [6] A Differentially Private K-means Clustering Scheme for Smart Grid
    Guo, Shuai
    Wen, Mi
    Liang, Xiaohui
    International Journal of Network Security, 2021, 23 (01) : 126 - 134
  • [7] Private Distributed K-Means Clustering on Interval Data
    Huang, Dingquan
    Yao, Xin
    An, Senquan
    Ren, Shengbing
    2021 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE (IPCCC), 2021,
  • [8] DIFFERENTIALLY PRIVATE COMPRESSIVE K-MEANS
    Schellekens, V.
    Chatalic, A.
    Houssiau, F.
    de Montjoye, Y. -A.
    Jacques, L.
    Gribonval, R.
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 7933 - 7937
  • [9] Locally Private k-Means Clustering
    Stemmer, Uri
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 548 - 559
  • [10] Locally Private k-Means Clustering
    Stemmer, Uri
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 548 - 559