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] BIM performance assessment system using a K-means clustering algorithm
    Kim, Hyeon-Seung
    Kim, Sung-Keun
    Kang, Leen-Seok
    JOURNAL OF ASIAN ARCHITECTURE AND BUILDING ENGINEERING, 2021, 20 (01) : 78 - 87
  • [32] Distributed privacy preservation for online social network using flexible clustering and whale optimization algorithm
    Uke, Nilesh J.
    Lokhande, Sharayu A.
    Kale, Preeti
    Pawar, Shilpa Devram
    Junnarkar, Aparna A.
    Yadav, Sulbha
    Bhavsar, Swapna
    Mahajan, Hemant
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2024, 27 (05): : 5995 - 6012
  • [33] Analysis of Electricity Consumption at Home Using K-means Clustering Algorithm
    Choi, Hyun Wong
    Qureshi, Nawab Muhammad Faseeh
    Shin, Dong Ryeol
    2019 21ST INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT): ICT FOR 4TH INDUSTRIAL REVOLUTION, 2019, : 639 - 643
  • [34] A fast k-means clustering algorithm using cluster center displacement
    Lai, Jim Z. C.
    Huang, Tsung-Jen
    Liaw, Yi-Ching
    PATTERN RECOGNITION, 2009, 42 (11) : 2551 - 2556
  • [35] Metamodeling by using Multiple Regression Integrated K-Means Clustering Algorithm
    Irfanoglu, Emre
    Akgun, Ilker
    Gunal, Murat M.
    EMERGING M&S APPLICATIONS IN INDUSTRY AND ACADEMIA SYMPOSIUM AND THE MODELING AND HUMANITIES SYMPOSIUM 2013 (EAIA AND MATH 2013) - 2013 SPRING SIMULATION MULTI-CONFERENCE (SPRINGSIM'13), 2013, 45 (05): : 55 - 62
  • [36] Identification of Typical Load Profiles using K-Means Clustering Algorithm
    Azad, Salahuddin A.
    Ali, A. B. M. Shawkat
    Wolfs, Peter
    2014 ASIA-PACIFIC WORLD CONGRESS ON COMPUTER SCIENCE AND ENGINEERING (APWC ON CSE), 2014,
  • [37] An accelerated K-means clustering algorithm using selection and erasure rules
    Suiang-Shyan LEE
    Ja-Chen LIN
    Frontiers of Information Technology & Electronic Engineering, 2012, (10) : 761 - 768
  • [38] An accelerated K-means clustering algorithm using selection and erasure rules
    Lee, Suiang-Shyan
    Lin, Ja-Chen
    JOURNAL OF ZHEJIANG UNIVERSITY-SCIENCE C-COMPUTERS & ELECTRONICS, 2012, 13 (10): : 761 - 768
  • [39] Weighted joint LRTs for cooperative spectrum sensing using K-means clustering
    Fouda, Hager S.
    Farghaly, Samar I.
    Dawood, Heba S.
    PHYSICAL COMMUNICATION, 2024, 67
  • [40] Practical Privacy-Preserving MapReduce Based K-Means Clustering Over Large-Scale Dataset
    Yuan, Jiawei
    Tian, Yifan
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (02) : 568 - 579