AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (1.7 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access | Just Accepted

DPKC: A Privacy-preserving Availability-enhanced Clustering Scheme for Data Analysis in IoMT

Shaobo Zhang1,2Yuxing Li1,2Entao Luo3Fan Wu4( )Tian Wang5,6,7Weizhi Meng8

1 Shaobo Zhang and Yuxing Li are with Sanya Institute of Hunan University of Science and Technology, Sanya 572024, China

2 School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan 411201, China

3 School of Information Engineering, Hunan University of Science and Engineering, Yongzhou, 425199, China

4 School of Computer Science and Engineering, Central South University, Changsha, 410083, China

5 Artificial Intelligence and Future Networks, Beijing Normal University, Zhuhai, 519087, China

6 College of Computer and Data Science, Fuzhou University, 350108, Fuzhou, China

7 Computer Science and Mathematics, Fujian University of Technology, 350118, Fuzhou, China

8 School of Computing and Communications, Lancaster University, United Kingdom

Show Author Information

Abstract

The advancement of the Internet of Medical Things (IoMT) has rendered the clustering method pivotal in medical data analysis. Nevertheless, the exposure of patient privacy during this process constitutes a significant security concern. To achieve privacy protection for cluster analysis while ensuring the accuracy of clustering results in IoMT, this paper proposes a Differential Privacy-based availability-enhanced k-modes Clustering scheme, named DPKC. First, we introduce partition entropy to quantify attribute weights and calculate the initial center based on density with distance. This can mitigate the impact of random initialization, thus improving the accuracy of the clustering results. Second, we introduce cluster weights to calculate the distance between data points and centers during allocation. This adjustment aims to reduce the difference in compactness between clusters. Third, we employ a geometric mechanism to inject noise into the frequency of attribute values, ensuring data privacy during the iteration process. Theoretical analysis proves that DPKC satisfies differential privacy and prevents information disclosure. Experimental results show that DPKC improves the F-measure metric by 7.36% compared to existing algorithms.

References

【1】
【1】
 
 
Big Data Mining and Analytics

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Zhang S, Li Y, Luo E, et al. DPKC: A Privacy-preserving Availability-enhanced Clustering Scheme for Data Analysis in IoMT. Big Data Mining and Analytics, 2025, https://doi.org/10.26599/BDMA.2025.9020108

417

Views

33

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Received: 22 May 2025
Revised: 16 September 2025
Accepted: 10 October 2025
Available online: 21 November 2025

© The author(s) 2025

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).