Privacy preserving using joint 2 K-means clustering and coati optimization algorithm for online social networks

被引:0
|
作者
Gowda N.R. [1 ]
Venkatesh [2 ]
Venugopal K.R. [3 ]
机构
[1] Department of Computer Science and Engineering, University Visvesvaraya College of Engineering, Bangalore University, Bengaluru
[2] Department Computer Science and Engineering, University Visvesvaraya College of Engineering, Bangalore University, Bengaluru
[3] University Visvesvaraya College of Engineering, Bangalore University, Bangalore
关键词
Anonymization; Clusters; COA; Cost function; K-anonymity; K-means clustering; L-diversity; T-closeness;
D O I
10.1007/s41870-024-01729-w
中图分类号
学科分类号
摘要
Social networks, that have grown so prevalent nowadays, enable users to exchange information and save a significant amount of personal data about them. Although the information that is stored can be useful for enhancing the quality of services provided to users, it also poses a risk to their privacy. This is because social networks contain private information about users. As a result, members of social networks seek to protect the confidentiality of their shared data. The most popular method for protecting confidentiality is anonymizing data, which involves modifying or eliminating some information while trying to preserve as much of the original data as possible. The high level of data loss, similarities attacks, and protection from attribute or link disclosure is problem with existing anonymity approaches. The study proposes a hybrid approach based on K-member k-means clustering and coati optimization algorithm (2KMCOA) as a successful solution for balanced clustering and anonymizing in social networks in order to get over these shortcomings. A K-member K-means clustering algorithm is used to divide the different users into C clusters and each cluster has at least K users, as part of the proposed anonymization procedure. Following clustering, an initial solution is generated that produces the modified data table which should satisfy objective functions and three constraints. The coati optimization algorithm (COA) is then utilized to optimize the primary clusters even more to anonymize the data as well as network graph. The efficiency of the proposed 2KMCOA is compared with other existing anonymity techniques K-means clustering with COA (KMCOA) and K- member K-means clustering without COA (2K) in terms of clustering error, balancing error, distortion rate, objective function, cost function and CPU running time. © The Author(s), under exclusive licence to Bharati Vidyapeeth's Institute of Computer Applications and Management 2024.
引用
收藏
页码:2715 / 2724
页数:9
相关论文
共 50 条
  • [31] Privacy-preserving kernel k-means clustering outsourcing with random transformation
    Keng-Pei Lin
    Knowledge and Information Systems, 2016, 49 : 885 - 908
  • [32] Efficient and Privacy-Preserving k-means clustering For Big Data Mining
    Gheid, Zakaria
    Challal, Yacine
    2016 IEEE TRUSTCOM/BIGDATASE/ISPA, 2016, : 791 - 798
  • [33] Privacy-preserving kernel k-means clustering outsourcing with random transformation
    Lin, Keng-Pei
    KNOWLEDGE AND INFORMATION SYSTEMS, 2016, 49 (03) : 885 - 908
  • [34] Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes
    Su, Chunhua
    Bao, Feng
    Zhou, Jianying
    Takagi, Tsuyoshi
    Sakurai, Kouichi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2009, E92A (04) : 1246 - 1250
  • [35] Privacy-Preserving and Outsourced Multi-User k-Means Clustering
    Rao, Fang-Yu
    Samanthula, Bharath K.
    Bertino, Elisa
    Yi, Xun
    Liu, Dongxi
    2015 IEEE CONFERENCE ON COLLABORATION AND INTERNET COMPUTING (CIC), 2015, : 80 - 89
  • [36] Privacy-Preserving k-means Clustering: an Application to Driving Style Recognition
    El Omri, Othmane
    Boudguiga, Aymen
    Izabachene, Malika
    Klaudel, Witold
    NETWORK AND SYSTEM SECURITY, NSS 2019, 2019, 11928 : 685 - 696
  • [37] Outsourced and Privacy-Preserving K-means Clustering Scheme for Smart Grid
    Shen, Xielin
    Yuan, Bo
    Peng, Weiwen
    Qian, Yuanquan
    Wu, Yonghua
    2022 IEEE 10TH INTERNATIONAL CONFERENCE ON INFORMATION, COMMUNICATION AND NETWORKS (ICICN 2022), 2022, : 307 - 313
  • [38] Design topologies optimization in GPON networks based on population densities using k-means clustering algorithm
    Zeballos Amable, Guillermo
    Vela Moscoso, Jaime Felipe
    2019 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND COMPUTERS (CONIELECOMP), 2019, : 60 - 65
  • [39] Hybrid Backtracking Search Optimization Algorithm and K-Means for Clustering in Wireless Sensor Networks
    Latiff, N. M. Abdul
    Malik, N. N. Nik Abdul
    Idoumghar, L.
    2016 IEEE 14TH INTL CONF ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, 14TH INTL CONF ON PERVASIVE INTELLIGENCE AND COMPUTING, 2ND INTL CONF ON BIG DATA INTELLIGENCE AND COMPUTING AND CYBER SCIENCE AND TECHNOLOGY CONGRESS (DASC/PICOM/DATACOM/CYBERSC, 2016, : 558 - 564
  • [40] Optimization of K-means clustering method using hybrid capuchin search algorithm
    Amjad Qtaish
    Malik Braik
    Dheeb Albashish
    Mohammad T. Alshammari
    Abdulrahman Alreshidi
    Eissa Jaber Alreshidi
    The Journal of Supercomputing, 2024, 80 : 1728 - 1787