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 条
  • [1] Privacy Preserving Approximate K-means Clustering
    Biswas, Chandan
    Ganguly, Debasis
    Roy, Dwaipayan
    Bhattacharya, Ujjwal
    PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM '19), 2019, : 1321 - 1330
  • [2] Mutual Privacy Preserving k-Means Clustering in Social Participatory Sensing
    Xing, Kai
    Hu, Chunqiang
    Yu, Jiguo
    Cheng, Xiuzhen
    Zhang, Fengjuan
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2017, 13 (04) : 2066 - 2076
  • [3] Privacy Preserving Clustering: A k-Means Type Extension
    Li, Wenye
    NEURAL INFORMATION PROCESSING (ICONIP 2014), PT II, 2014, 8835 : 319 - 326
  • [4] Privacy-preserving k-means clustering with local synchronization in peer-to-peer networks
    Zhu, Youwen
    Li, Xingxin
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2020, 13 (06) : 2272 - 2284
  • [5] Privacy-Preserving K-Means Clustering Upon Negative Databases
    Hu, Xiaoyi
    Lu, Liping
    Zhao, Dongdong
    Xiang, Jianwen
    Liu, Xing
    Zhou, Haiying
    Xiong, Shengwu
    Tian, Jing
    NEURAL INFORMATION PROCESSING (ICONIP 2018), PT IV, 2018, 11304 : 191 - 204
  • [6] Importance of Data Standardization in Privacy-Preserving K-Means Clustering
    Su, Chunhua
    Zhan, Justin
    Sakurai, Kouichi
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2009, 5667 : 276 - +
  • [7] Distributed threshold k-means clustering for privacy preserving data mining
    Baby, Vadlana
    Chandra, N. Subhash
    2016 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2016, : 2286 - 2289
  • [8] K-Means Clustering With Local dχ-Privacy for Privacy-Preserving Data Analysis
    Yang, Mengmeng
    Tjuawinata, Ivan
    Lam, Kwok-Yan
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2022, 17 : 2524 - 2537
  • [9] 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
  • [10] 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