CLARE: A Semi-supervised Community Detection Algorithm

Abstract

Community detection refers to the task of discovering closely related subgraphs to understand the networks. However, traditional community detection algorithms fail to pinpoint a particular kind of community. This limits its applicability in real-world networks, e.g., distinguishing fraud groups from normal ones in transaction networks. Recently, semi-supervised community detection emerges as a solution. It aims to seek other similar communities in the network with few labeled communities as training data. Existing works can be regarded as seed-based: locate seed nodes and then develop communities around seeds. However, these methods are quite sensitive to the quality of selected seeds since communities generated around a mis-detected seed may be irrelevant. Besides, they have individual issues, e.g., inflexibility and high computational overhead. To address these issues, we propose CLARE, which consists of two key components, Community Locator and Community Rewriter. Our idea is that we can locate potential communities and then refine them. Therefore, the community locator is proposed for quickly locating potential communities by seeking subgraphs that are similar to training ones in the network. To further adjust these located communities, we devise the community rewriter. Enhanced by deep reinforcement learning, it suggests intelligent decisions, such as adding or dropping nodes, to refine community structures flexibly. Extensive experiments verify both the effectiveness and efficiency of our work compared with prior state-of-the-art approaches on multiple real-world datasets.

arXiv commentAccepted by KDD'2022

References in corpus (11)

• Fast unfolding of communities in large networks
• Finding community structure in very large networks
• Learning Combinatorial Optimization Algorithms over Graphs
• Pitfalls of Graph Neural Network Evaluation
• Community Detection in Networks with Node Attributes
• Graph Matching Networks for Learning the Similarity of Graph Structured Objects
• Normalized Mutual Information to evaluate overlapping community finding algorithms
• Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning
• Neural Subgraph Matching
• A simple yet effective baseline for non-attributed graph classification
• vGraph: A Generative Model for Joint Community Detection and Node Representation Learning