New Recipe for Semi-supervised Community Detection: Clique Annealing under Crystallization Kinetics
원문 초록
Semi-supervised community detection methods are widely used for identifying specific communities due to the label scarcity. Existing semi-supervised community detection methods typically involve two learning stages learning in both initial identification and subsequent adjustment, which often starts from an unreasonable community core candidate. Moreover, these methods encounter scalability issues because they depend on reinforcement learning and generative adversarial networks, leading to higher computational costs and restricting the selection of candidates. To address these limitations, we draw a parallel between crystallization kinetics and community detection to integrate the spontaneity of the annealing process into community detection. Specifically, we liken community detection to identifying a crystal subgrain (core) that expands into a complete grain (community) through a process similar to annealing. Based on this finding, we propose CLique ANNealing (CLANN), which applies kinetics concepts to community detection by integrating these principles into the optimization process to strengthen the consistency of the community core. Subsequently, a learning-free Transitive Annealer was employed to refine the first-stage candidates by merging neighboring cliques and repositioning the community core, enabling a spontaneous growth process that enhances scalability. Extensive experiments on \textbf{43} different network settings demonstrate that CLANN outperforms state-of-the-art methods across multiple real-world datasets, showcasing its exceptional efficacy and efficiency in community detection.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach
Breaking the Batch Barrier (B3) of Contrastive Learning via Smart Batch Mining
Advancing Community Detection with Graph Convolutional Neural Networks: Bridging Topological and Attributive Cohesion
Community and hyperedge inference in multiple hypergraphs
Adaptive Long-term Embedding with Denoising and Augmentation for Recommendation
Robust Markov stability for community detection at a scale learned based on the structure
토론
이 논문과 연결된 포럼 글이 아직 없습니다.