How to Protect Ourselves From Overlapping Community Detection in Social Networks
- 18 February 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 8 (4) , 894-904
Abstract
In recent years, overlapping community detection algorithms have been paid more and more attention, which not only reveal the real social relations, but also expose the possible communication channels between communities. Those individuals (or people) in the overlapping area are very important to the communities that can promote communication between two or more communities. On the other hand, from the privacy perspective, some people may not want to be found out in the overlapping areas. With this in mind, we raise a question “Can individuals modify their relationships to avoid the community discovery algorithms locating them into overlapping areas?” If this problem could be solved, these people may not need to worry about being disturbed. In particular, we first give three heuristic hiding strategies, i.e., Random Hiding(RH), Based Degree Hiding(DH) and Betweenness Hiding(BH), as comparison, utilizing the randomly the node, information of node degree and node betweenness centrality, respectively. And then, we propose a novel hiding algorithm by exploiting the importance degree of nodes in communities based on which the corresponding social connections are added or deleted called name BIH . Through extensive experiments, we show the effectiveness of the proposed algorithm in moving out a target node from overlapped areas.Keywords
Funding Information
- National Natural Science Foundation of China (62072160)
- Key Scientific and Technical Project of Henan Province (212102310381)
- Henan Normal University (20210347)
This publication has 45 references indexed in Scilit:
- Overlapping community detection in networksACM Computing Surveys, 2013
- Efficient discovery of overlapping communities in massive networksProceedings of the National Academy of Sciences, 2013
- Finding Statistically Significant Communities in NetworksPLOS ONE, 2011
- Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network DynamicsPLOS ONE, 2010
- Link communities reveal multiscale complexity in networksNature, 2010
- Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneitiesPhysical Review E, 2009
- Maps of random walks on complex networks reveal community structureProceedings of the National Academy of Sciences, 2008
- Clustering by Passing Messages Between Data PointsScience, 2007
- Comparing community structure identificationJournal of Statistical Mechanics: Theory and Experiment, 2005
- Uncovering the overlapping community structure of complex networks in nature and societyNature, 2005