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] Energy optimization in wireless sensor networks using a hybrid K-means PSO clustering algorithm
    Solaiman, Basma Fathi
    Sheta, Alaa
    TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES, 2016, 24 (04) : 2679 - 2695
  • [22] A Fine-grained Privacy-preserving k-means Clustering Algorithm Upon Negative Databases
    Zhao, Dongdong
    Hu, Xiaoyi
    Xiong, Shengwu
    Tian, Jing
    Xiang, Jianwen
    Zhou, Jing
    Li, Huanhuan
    2019 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI 2019), 2019, : 1945 - 1951
  • [23] Soil data clustering by using K-means and fuzzy K-means algorithm
    Hot, Elma
    Popovic-Bugarin, Vesna
    2015 23RD TELECOMMUNICATIONS FORUM TELFOR (TELFOR), 2015, : 890 - 893
  • [24] K-means Clustering Optimization Algorithm Based on MapReduce
    Li, Zhihua
    Song, Xudong
    Zhu, Wenhui
    Chen, Yanxia
    PROCEEDINGS OF THE 2015 INTERNATIONAL SYMPOSIUM ON COMPUTERS & INFORMATICS, 2015, 13 : 198 - 203
  • [25] K-means Optimization Algorithm for Solving Clustering Problem
    Dong, Jinxin
    Qi, Minyong
    WKDD: 2009 SECOND INTERNATIONAL WORKSHOP ON KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2009, : 52 - 55
  • [26] Outsourcing Two-party Privacy Preserving K-means Clustering Protocol In Wireless Sensor Networks
    Liu, Xiaoyan
    Jiang, Zoe L.
    Yiu, S. M.
    Wang, Xuan
    Tan, Chuting
    Li, Ye
    Liu, Zechao
    Jin, Yabin
    Fang, Junbin
    2015 11TH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS (MSN), 2015, : 124 - 133
  • [27] An Improved K-means Clustering Algorithm for Complex Networks
    Li, Hao
    Wang, Haoxiang
    Chen, Zengxian
    PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND ELECTRONIC TECHNOLOGY, 2015, 3 : 90 - 93
  • [28] K-means clustering algorithm using the entropy
    Palubinskas, G
    IMAGE AND SIGNAL PROCESSING FOR REMOTE SENSING IV, 1998, 3500 : 63 - 71
  • [29] Efficient privacy-preserving outsourced k-means clustering on distributed data
    Qiu, Guowei
    Zhao, Yingliang
    Gui, Xiaolin
    INFORMATION SCIENCES, 2024, 674
  • [30] An Efficient Approach for Privacy Preserving Distributed K-Means Clustering in Unsecured Environment
    Shewale, Amit
    Keshavamurthy, B. N.
    Modi, Chirag N.
    RECENT FINDINGS IN INTELLIGENT COMPUTING TECHNIQUES, VOL 1, 2019, 707 : 425 - 431