Enhancing Privacy and Availability for Data Clustering in Intelligent Electrical Service of IoT
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
The ever-growing demand for electrical energy of sensing devices in the Internet of Things (IoT) has led to generating large amounts of electricity consumption data. Electricity service providers often use wireless sensor networks to collect sensing devices' electricity consumption data for statistical analysis, so as to provide sensing devices with improved electrical services. As an important data mining technique, while data clustering excels in dealing with such massive data, it imposes the risk of privacy disclosure in the process of data clustering. In an effort of solving this problem, Blum et al. proposed a differential privacy k-means algorithm, effectively preventing privacy disclosure. However, the availability of data clustering results is reduced due to the data distortion in Blum's algorithm. In this paper, we propose a privacy and availability data clustering (PADC) scheme based on k -means algorithm and differential privacy, which enhances the selection of the initial center points and the distance calculation method from other points to center point. Moreover, PADC attempts to reduce the outlier effect through detecting outliers during the clustering process. Security analysis indicates that our scheme satisfies the goal of differential privacy and prevents privacy information disclosure. Meanwhile, performance evaluation shows that our scheme, at the same privacy level, improves the availability of clustering results compared to the existing differential privacy k-means algorithms, suggesting that our proposed PADC scheme outperforms others for intelligent electrical service in IoT.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“In recent years there have been many privacy protection methods based on k-anonymous [25] and data division, such as the l-diversity [26] and the t-closeness [27].”
MethodCalibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Differential Privacy: A Survey of Results
Dwork, C. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-79228-4_1 · Cited by 3,542 · cited 1×
“In this paper, our research focuses on the study of clustering analysis based on differential privacy protection [23], a new privacy model grounded on data distortion [24].”
Backgroundt-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
Lin, J., Yu, W., Zhang, N., Yang, X., Zhang, H., & Zhao, W. (2017) · IEEE Internet of Things Journal · doi:10.1109/jiot.2017.2683200 · Cited by 2,793
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Privacy-preserving k -means clustering over vertically partitioned data
Vaidya, J., & Clifton, C. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956776 · Cited by 626 · cited 2×
“As an example, Vaidya and Clifton [17] proposed a secure multi-k-means algorithm based on vertical distribution data, and Jha et al.”
Method
Cited by
A Survey on Metaverse: Fundamentals, Security, and Privacy
Wang, Y., Su, Z., Zhang, N., Xing, R., Liu, D., Luan, T. H., & Shen, X. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3202047 · Cited by 1,575
Differential Privacy Techniques for Cyber Physical Systems: A Survey
Hassan, M. U., Rehmani, M. H., & Chen, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2944748 · Cited by 564
“Contrary to traditional differential privacy approaches, authors in [188] introduced”
BackgroundComputation Offloading Toward Edge Computing
Lin, L., Liao, X., Jin, H., & Li, P. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2922285 · Cited by 456
A metaheuristic optimization approach for energy efficiency in the IoT networks
Iwendi, C., Maddikunta, P. K. R., Gadekallu, T. R., Lakshmanna, K., Bashir, A. K., & Piran, M. J. (2021) · Software: Practice and Experience · doi:10.1002/spe.2797 · Cited by 258
New Frontiers in IoT: Networking, Systems, Reliability, and Security Challenges
Bagchi, S., Abdelzaher, T. F., Govindan, R., Shenoy, P., Atrey, A., Ghosh, P., & Xu, R. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3007690 · Cited by 72
“Another promising approach is the combination of traditional differential privacy methods with ML to protect aggregate user data [71], [123], [124].”
Method
Metadata
- Authors
- Xiong, J., Ren, J., Chen, L., Yao, Z., Lin, M., Wu, D., & Niu, B.
- Venue
- IEEE Internet of Things Journal
- Published
- 2019-04
- Volume
- 6
- Issue
- 2
- Pages
- 1530-1540
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W2806161436
- Cited by
- 196
- References
- 7
- FWCI
- 16.55
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.