Community Hiding by Link Perturbation in Social Networks
- 8 February 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 8 (3) , 704-715
Abstract
Complex social network is a kind of relationship system composed of many nodes according to social relations. Community detection helps scholars to understand this network topology and find out meaningful communities. Many scholars are therefore actively exploring new community detection algorithms. However, it brings privacy issues such as the disclosure of personal or group information of community members and goes against an individual or group desire to be hidden. Hence, how to hide a target community in a network to resist the community detection algorithms becomes critical. Given this, this article studies the community hiding problem, which has not been extensively focused so far and aims to properly hide a target community into other communities by perturbing a budget limited number of social links. First, we formalize the community hiding problem and design a gain function. Second, we prove the feasibility of link perturbation operations and propose an efficient algorithm to solve the community hiding problem. Finally, we conduct extensive experiments on varieties of real small- and large-scale social networks and compare our method with other community deception algorithms. The experimental results demonstrate that the proposed algorithm is more efficient than previously proposed algorithms.Keywords
Funding Information
- Natural Science Basis Research Plan in Shaanxi Province of China (2020JM-203)
- Fundamental Research Funds for the Central Universities of China (JB211501)
- National Natural Science Foundation of China (61502375)
- NSF (III-1763325, III-1909323, SaTC-1930941)
This publication has 32 references indexed in Scilit:
- The map equationThe European Physical Journal Special Topics, 2009
- Community detection in networks with positive and negative linksPhysical Review E, 2009
- Multiresolution community detection for megascale networks by information-based replica correlationsPhysical Review E, 2009
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Maps of random walks on complex networks reveal community structureProceedings of the National Academy of Sciences, 2008
- Near linear time algorithm to detect community structures in large-scale networksPhysical Review E, 2007
- Clustering by Passing Messages Between Data PointsScience, 2007
- Finding community structure in networks using the eigenvectors of matricesPhysical Review E, 2006
- Statistical mechanics of community detectionPhysical Review E, 2006
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005