Uncovering the Local Hidden Community Structure in Social Networks
- URL: http://arxiv.org/abs/2112.04100v1
- Date: Wed, 8 Dec 2021 04:07:19 GMT
- Title: Uncovering the Local Hidden Community Structure in Social Networks
- Authors: Meng Wang, Boyu Li, Kun He, John E. Hopcroft
- Abstract summary: We propose a new method that detects and boosts each layer iteratively on a subgraph sampled from the original network.
We theoretically show that our method can avoid some situations that a broken community and the local community are regarded as one community in the subgraph.
- Score: 20.467702194064525
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Hidden community is a useful concept proposed recently for social network
analysis. To handle the rapid growth of network scale, in this work, we explore
the detection of hidden communities from the local perspective, and propose a
new method that detects and boosts each layer iteratively on a subgraph sampled
from the original network. We first expand the seed set from a single seed node
based on our modified local spectral method and detect an initial dominant
local community. Then we temporarily remove the members of this community as
well as their connections to other nodes, and detect all the neighborhood
communities in the remaining subgraph, including some "broken communities" that
only contain a fraction of members in the original network. The local community
and neighborhood communities form a dominant layer, and by reducing the edge
weights inside these communities, we weaken this layer's structure to reveal
the hidden layers. Eventually, we repeat the whole process and all communities
containing the seed node can be detected and boosted iteratively. We
theoretically show that our method can avoid some situations that a broken
community and the local community are regarded as one community in the
subgraph, leading to the inaccuracy on detection which can be caused by global
hidden community detection methods. Extensive experiments show that our method
could significantly outperform the state-of-the-art baselines designed for
either global hidden community detection or multiple local community detection.
Related papers
- Enhancing Community Detection in Networks: A Comparative Analysis of Local Metrics and Hierarchical Algorithms [49.1574468325115]
This study employs the same method to evaluate the relevance of using local similarity metrics for community detection.
The efficacy of these metrics was evaluated by applying the base algorithm to several real networks with varying community sizes.
arXiv Detail & Related papers (2024-08-17T02:17:09Z) - CS-TGN: Community Search via Temporal Graph Neural Networks [0.0]
We propose a query-driven Temporal Graph Convolutional Network (CS-TGN) that can capture flexible community structures.
CS-TGN first combines the local query-dependent structure and the global graph embedding in each snapshot of the network.
We demonstrate how this model can be used for interactive community search in an online setting.
arXiv Detail & Related papers (2023-03-15T22:23:32Z) - Co-Membership-based Generic Anomalous Communities Detection [0.0]
We introduce the Co-Membership-based Generic Anomalous Communities Detection Algorithm (referred as to CMMAC)
CMMAC is domain-free and almost unaffected by communities' sizes and densities.
We present an algorithm for generating a community-structured random network enabling the infusion of anomalous communities.
arXiv Detail & Related papers (2022-03-30T12:23:55Z) - A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
A community reveals the features and connections of its members that are different from those in other communities in a network.
This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods.
The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
arXiv Detail & Related papers (2021-05-26T14:37:07Z) - Hide and Seek: Outwitting Community Detection Algorithms [17.144388833011536]
Community affiliation plays an important role in determining a node's contextual position in a network.
This study focuses on hiding such sensitive communities so that the community affiliation of the targeted nodes can be concealed.
We introduce NEURAL, a novel method that greedily optimize a node-centric objective function to determine the rewiring strategy.
arXiv Detail & Related papers (2021-02-22T03:50:44Z) - A multilevel clustering technique for community detection [0.0]
This study presents a novel detection method based on a scalable framework to identify related communities in a network.
We propose a multilevel clustering technique (MCT) that leverages structural and textual information to identify local communities termed microcosms.
The approach offers a better understanding and clarity toward describing how low-level communities evolve and behave on Twitter.
arXiv Detail & Related papers (2021-01-16T23:26:44Z) - A Survey of Community Detection Approaches: From Statistical Modeling to
Deep Learning [95.27249880156256]
We develop and present a unified architecture of network community-finding methods.
We introduce a new taxonomy that divides the existing methods into two categories, namely probabilistic graphical model and deep learning.
We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
arXiv Detail & Related papers (2021-01-03T02:32:45Z) - On the use of local structural properties for improving the efficiency
of hierarchical community detection methods [77.34726150561087]
We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection.
We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
arXiv Detail & Related papers (2020-09-15T00:16:12Z) - Detecting Communities in Heterogeneous Multi-Relational Networks:A
Message Passing based Approach [89.19237792558687]
Community is a common characteristic of networks including social networks, biological networks, computer and information networks.
We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
arXiv Detail & Related papers (2020-04-06T17:36:24Z) - Certified Robustness of Community Detection against Adversarial
Structural Perturbation via Randomized Smoothing [81.71105567425275]
We develop the first certified robustness guarantee of community detection against adversarial structural perturbation.
We theoretically show that the smoothed community detection method provably groups a given arbitrary set of nodes into the same community.
We also empirically evaluate our method on multiple real-world graphs with ground truth communities.
arXiv Detail & Related papers (2020-02-09T18:39:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.