Community detection aims to identify the cohesive vertex sets in a network. It is widely used in many domains, e.g., World Wide Web, online social networks, and communication networks. Many clustering models are proposed in the literature. However, most of them are designed directly on the original structure of a network, they usually achieve low accuracy in practice, since real-world networks are presenting fuzzy community structures. Recently, higher-order network units are introduced to community detection, these models typically define a higher-order hypergraph, where communities are extracted. Although the higher-order models are effective in terms of accuracy, many essential edges are completely eliminated or trivialized in the hypergraph. To address the problem, we propose a novel connectivity pattern with a mixture of standard edges and higher-order connections, whereby we define biased personalized PageRank diffusion for local community detection and develop a local approach to compute the PageRank vectors. Moreover, we present a higher-order seeding strategy to derive the starting seeds. Extensive experiments demonstrate that the proposed framework largely outperforms the approaches in the state of the art in terms of accuracy.
Stance detection aims to identify individuals' attitudes toward a specific target. The signs of links are beneficial in various graph-related tasks. However, existing stance detection methods neglect this information. This is because the signs of links are not explicitly provided in many real-world social networks, which makes current signed network representation learning methods inapplicable to this scenario. In this work, we propose a Sign-Aware Graph Learning framework (SAGL) for stance detection by innovating a Sign-Inferred Graph Auto-Encoder (SIGAE) and a Balance-Infused Signed Graph Attention Network (BSGAN). SIGAE infers and generates signed links from unsigned networks by exploiting stance labels and underlying structure information. BSGAN introduces balance theory into signed graph attention networks and refines node representations by capturing and dynamically adjusting the influence of signed links. Extensive experiments on real-world datasets demonstrate that SAGL significantly outperforms competitive baselines.
Social spammers pose a serious threat to online social networks by manipulating topics, promoting malicious campaigns, and spreading low-quality or deceptive content at scale. Existing detection methods, including text-based classifiers, graph neural networks, and hybrid models, still suffer from three key limitations: they usually operate at a single structural scale, they treat content and network structure as loosely coupled signals, and they often assign equal importance to all edges within the same relation type. To address these issues, we propose MHGCA, a Multi-scale Heterogeneous Graph learning framework with Content–Structure Alignment for robust spammer detection. MHGCA jointly encodes motif-, community-, and global-level structures, detects structural anomaly patterns, and employs a relation-aware transformer to adaptively align content similarity with relation-specific message passing. Experiments on two real-world Twitter datasets show that MHGCA consistently outperforms strong baselines under severe class imbalance and limited supervision, and remains stable across different training ratios and hyperparameter settings. These results suggest that explicitly aligning content with multi-scale heterogeneous structures is crucial for reliable spammer detection in social networks.