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 条
  • [21] Equally contributory privacy-preserving k-means clustering over vertically partitioned data
    Yi, Xun
    Zhang, Yanchun
    INFORMATION SYSTEMS, 2012, 38 (01) : 97 - 107
  • [22] DEM Fusion using a modified k-means clustering algorithm
    Fuss, Colleen E.
    Berg, Aaron A.
    Lindsay, John B.
    INTERNATIONAL JOURNAL OF DIGITAL EARTH, 2016, 9 (12) : 1242 - 1255
  • [23] NEW ALGORITHM FOR CLUSTERING DISTRIBUTED DATA USING K-MEANS
    Khedr, Ahmed M.
    Bhatnagar, Raj K.
    COMPUTING AND INFORMATICS, 2014, 33 (04) : 943 - 964
  • [24] Privacy Preserving in Online Social Networks Using Fuzzy Rewiring
    Kumar, Saurabh
    Kumar, Pradeep
    IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, 2023, 70 (06) : 2071 - 2079
  • [25] A Revised Dendritic Cell Algorithm Using K-Means Clustering
    Elisa, Noe
    Yang, Longzhi
    Qu, Yanpeng
    Chao, Fei
    IEEE 20TH INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE COMPUTING AND COMMUNICATIONS / IEEE 16TH INTERNATIONAL CONFERENCE ON SMART CITY / IEEE 4TH INTERNATIONAL CONFERENCE ON DATA SCIENCE AND SYSTEMS (HPCC/SMARTCITY/DSS), 2018, : 1547 - 1554
  • [26] A K-means Clustering Based Algorithm for Shill Bidding Recognition in Online Auction
    Lei, Bin
    Zhang, Huichao
    Chen, Huiyu
    Liu, Lili
    Wang, Dingwei
    PROCEEDINGS OF THE 2012 24TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2012, : 939 - 943
  • [27] Clustering Data in Power Management System Using k-Means Clustering Algorithm
    Aryani, Ressy
    Nasrun, Muhammad
    Setianingsih, Casi
    Murti, Muhammad Ary
    2019 IEEE ASIA PACIFIC CONFERENCE ON WIRELESS AND MOBILE (APWIMOB), 2019, : 164 - 170
  • [28] Outlier-eliminated k-means clustering algorithm based on differential privacy preservation
    Yu, Qingying
    Luo, Yonglong
    Chen, Chuanming
    Ding, Xintao
    APPLIED INTELLIGENCE, 2016, 45 (04) : 1179 - 1191
  • [29] Phase-Angle-Encoded Snake Optimization Algorithm for K-Means Clustering
    Xue, Dan
    Pang, Sen-Yuan
    Liu, Ning
    Liu, Shang-Kun
    Zheng, Wei-Min
    ELECTRONICS, 2024, 13 (21)
  • [30] Optimization of the Distributed K-means Clustering Algorithm Based on Set Pair Analysis
    Ling, Song
    Qi Yunfeng
    2015 8th International Congress on Image and Signal Processing (CISP), 2015, : 1593 - 1598