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 条
  • [41] Image segmentation algorithm based on dynamic particle swarm optimization and K-means clustering
    Xiaoqiong W.
    Zhang Y.E.
    International Journal of Computers and Applications, 2020, 42 (07) : 649 - 654
  • [42] Solving Traveling Salesman Problem using Firefly algorithm and K-means Clustering
    Jaradat, Ameera
    Matalkeh, Bara'ah
    Diabat, Waed
    2019 IEEE JORDAN INTERNATIONAL JOINT CONFERENCE ON ELECTRICAL ENGINEERING AND INFORMATION TECHNOLOGY (JEEIT), 2019, : 586 - 589
  • [43] MapReduce Model of Improved K-Means Clustering Algorithm Using Hadoop MapReduce
    Akthar, Nadeem
    Ahamad, Mohd Vasim
    Ahmad, Shahbaaz
    2016 SECOND INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE & COMMUNICATION TECHNOLOGY (CICT), 2016, : 192 - 198
  • [44] Bearing Fault Diagnosis using Hybrid Genetic Algorithm K-means Clustering
    Ettefagh, M. M.
    Ghaemi, M.
    Asr, M. Yazdanian
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INNOVATIONS IN INTELLIGENT SYSTEMS AND APPLICATIONS (INISTA 2014), 2014, : 84 - 89
  • [45] Privacy Preservation in Online Social Networks Using Multiple-Graph-Properties-Based Clustering to Ensure k-Anonymity, l-Diversity, and t-Closeness
    Gangarde, Rupali
    Sharma, Amit
    Pawar, Ambika
    Joshi, Rahul
    Gonge, Sudhanshu
    ELECTRONICS, 2021, 10 (22)
  • [46] K-Means Clustering-Aided Dynamic Multi-Cell Optimization Algorithm for HAPS
    Dai, Wei
    Yang, Siyuan
    Bouazizi, Mondher
    Ohtsuki, Tomoaki
    IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 5635 - 5640
  • [47] Corn Straw Coverage Calculation Algorithm Based on K-means Clustering and Zoning Optimization Method
    An X.
    Wang P.
    Luo C.
    Meng Z.
    Chen L.
    Zhang A.
    Nongye Jixie Xuebao/Transactions of the Chinese Society for Agricultural Machinery, 2021, 52 (10): : 84 - 89
  • [48] A new spectral coarse-graining algorithm based on K-means clustering in complex networks
    Zeng, Lang
    Jia, Zhen
    Wang, Yingying
    MODERN PHYSICS LETTERS B, 2019, 33 (01):
  • [49] Error Beacon Filtering Algorithm Based on K-Means Clustering for Underwater Wireless Sensor Networks
    Liu, Linfeng
    Du, Jingli
    Guo, Dongyue
    PROCEEDINGS OF 2016 8TH IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN 2016), 2016, : 435 - 438
  • [50] Analyzing the Evolution of Rare Events via Social Media Data and k-means Clustering Algorithm
    Lu, Xiaoyu Sean
    Zhou, MengChu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,