Improved clustering algorithm for personal privacy and security protection of elderly consumers

被引:0
|
作者
Jiang P. [1 ]
机构
[1] Guangxi Electrical Polytechnic Institute, Nanning, Guangxi
关键词
Clustering algorithm; Differential privacy; Elderly consumer; Privacy security;
D O I
10.1051/smdo/2023018
中图分类号
学科分类号
摘要
With the advancement of technology, there is an increasing emphasis on the personal privacy and security of elderly consumers. This article focuses on the personal privacy and security protection of elderly consumers. Based on the K-means (KM) clustering algorithm, the optimal value was obtained using the monarch butterfly optimization (MBO) algorithm. The migration operator and adjustment operator of the MBO algorithm were enhanced using differential variation algorithm and adaptive methods to obtain a modified monarch butterfly optimization (MMBO) algorithm. Then, to ensure secure protection during clustering, differential privacy (DP) was employed to add noise perturbation to data to obtained a method called DPMMBO-KM algorithm. In experiments on the UCI dataset, it was found that the MMBO-KM algorithm had better clustering performance. Taking the Iris dataset as an example, the MMBO-KM algorithm achieved the highest accuracy of 93.21%. In the application to recommendation systems, the DPMMBO-KM algorithm achieved higher F1 values under different privacy budgets; the average was 0.06. The results demonstrate that the improved clustering algorithm designed in this article can improve clustering results while ensuring personal privacy and data security, and also perform well in recommendation systems. © 2023 P. Jiang, Published by EDP Sciences.
引用
收藏
相关论文
共 50 条
  • [21] Node Attributed Query Access Algorithm Based on Improved Personalized Differential Privacy Protection in Social Network
    Xiaobo Yin
    Shunxiang Zhang
    Hui Xu
    International Journal of Wireless Information Networks, 2019, 26 : 165 - 173
  • [22] Node Attributed Query Access Algorithm Based on Improved Personalized Differential Privacy Protection in Social Network
    Yin, Xiaobo
    Zhang, Shunxiang
    Xu, Hui
    INTERNATIONAL JOURNAL OF WIRELESS INFORMATION NETWORKS, 2019, 26 (03) : 165 - 173
  • [23] Chiaroscuro: Transparency and Privacy for Massive Personal Time-Series Clustering
    Allard, Tristan
    Hebrail, Georges
    Masseglia, Florent
    Pacitti, Esther
    SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 779 - 794
  • [24] An Improved Weighted Clustering Algorithm in MANET
    WANG Jin XU Li ZHENG Bao-yu Deptartement of Information Engineering
    The Journal of China Universities of Posts and Telecommunications, 2004, (04) : 20 - 25
  • [25] An Improved Automatic FCM Clustering Algorithm
    Yu, Fuhua
    Xu, Hongke
    Wang, Limin
    Zhou, Xiaojian
    2010 2ND INTERNATIONAL WORKSHOP ON DATABASE TECHNOLOGY AND APPLICATIONS PROCEEDINGS (DBTA), 2010,
  • [26] Security level protection for intelligent terminals based on differential privacy
    Feng Wang
    Dingde Jiang
    Hong Wen
    Sheng Qi
    Telecommunication Systems, 2020, 74 : 425 - 435
  • [27] Security level protection for intelligent terminals based on differential privacy
    Wang, Feng
    Jiang, Dingde
    Wen, Hong
    Qi, Sheng
    TELECOMMUNICATION SYSTEMS, 2020, 74 (04) : 425 - 435
  • [28] Matrix Factorization Recommendation Algorithm for Differential Privacy Protection
    Wang Y.
    Ran X.
    Yin E.-M.
    Wang L.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2021, 50 (03): : 405 - 413
  • [29] An Effective Data Privacy Protection Algorithm Based on Differential Privacy in Edge Computing
    Qiao, Yi
    Liu, Zhaobin
    Lv, Haoze
    Li, Minghui
    Huang, Zhiyi
    Li, Zhiyang
    Liu, Weijiang
    IEEE ACCESS, 2019, 7 : 136203 - 136213
  • [30] Collaborative Filtering Algorithm Based on Personalized Privacy Protection
    Wang Y.
    Hu Y.
    Gao M.
    Peng J.
    Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology, 2023, 43 (04): : 367 - 375