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 M ulti-scale H eterogeneous G raph learning framework with C ontent–Structure A lignment 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.

Multimedia rumor content has been widely disseminated with the rise of generative technologies. Existing rumor detection approaches typically focus independently on multi-modal data (such as text and images) or social structure analysis, and only a few researchers have attempted to integrate all three modalities for comprehensive rumor detection. Due to the complexity of the relationships between these heterogeneous data, combining them effectively remains a challenge. In this work, we present a novel Graph-Enhanced Multimodal Contrastive Learning (GMCL) to integrate textual, visual, and social graph features more efficiently for rumor detection. We utilize semantic correlation to assist cross-modal contrastive learning to capture fine-grained alignment between text and image and enhance node representations through graph contrastive learning without relying on negative samples. By aligning and integrating these different representations, our method can detect rumors more accurately. Extensive experimental results show that our model outperforms current state-of-the-art methods in multimodal rumor detection.

Stance detection aims to automatically identify social users' attitudes on specific targets by analyzing their textual content and various relationships within social networks. Existing stance detection models predominantly focus on textual content. Although some stance detection methods based on graph neural networks have achieved performance improvements by integrating textual content and social relationships, they overlook the implicit polarity signs of links between nodes. Meanwhile, many real-world social networks do not provide explicit sign information for links, which limits the applicability of existing signed network representation learning methods to these scenarios. This paper proposes a novel social network stance detection model named 'Implicit Sign-enhanced Stance Detection Model with Semantic Graph Attention Network' (ISSDM-SemGAN). Firstly, we propose a semantic graph attention network (SemGAN) that leverages Direction-distance Fusion Scoring Function (DFSF) to enhance the differences between nodes, which lays the foundation for capturing implicit link signs. Additionally, we design implicit sign-enhanced stance detection network to introduce the signed link prediction task and social balance theory to facilitate understanding and learning the implicit link polarity between nodes, thereby enhancing the performance of stance detection tasks. Extensive experiments were conducted on real social network dataset. The experimental results demonstrate that ISSDM-SemGAN achieves state-of-the-art performance.

N-ary relational facts represent semantic correlations among more than two entities. While recent studies have developed link prediction (LP) methods to infer missing relations for knowledge graphs (KGs) containing n-ary relational facts, they are generally limited to transductive settings. Fully inductive settings, where predictions are made on previously unseen entities, remain a significant challenge. As existing methods are mainly entity embedding-based, they struggle to capture entity-independent logical rules. To fill in this gap, we propose an n-ary subgraph reasoning framework for fully inductive link prediction (ILP) on n-ary relational facts. This framework reasons over local subgraphs and has a strong inductive inference ability to capture n-ary patterns. Specifically, we introduce a novel graph structure, the n-ary semantic hypergraph, to facilitate subgraph extraction. Moreover, we develop a subgraph aggregating network, NS-HART, to effectively mine complex semantic correlations within subgraphs. Theoretically, we provide a thorough analysis from the score function optimization perspective to shed light on NS-HART's effectiveness for n-ary ILP tasks. Empirically, we conduct extensive experiments on a series of inductive benchmarks, including transfer reasoning (with and without entity features) and pairwise subgraph reasoning. The results highlight the superiority of the n-ary subgraph reasoning framework and the exceptional inductive ability of NS-HART.

Link prediction is a core task in graph machine learning with wide applications. However, little attention has been paid to link prediction between two group entities. This limits the application of the current approaches to many real-life problems, such as predicting collaborations between academic groups or recommending bundles of items to group users. Moreover, groups are often ephemeral or emergent, forcing the predicting model to deal with challenging inductive scenes. To fill this gap, we develop a framework composed of a GNN-based encoder and neural-based aggregating networks, namely the Mutual Multi-view Attention Networks (MMAN). First, we adopt GNN-based encoders to model multiple interactions among members and groups through propagating. Then, we develop MMAN to aggregate members' node representations into multi-view group representations and compute the final results by pooling pairwise scores between views. Specifically, several view-guided attention modules are adopted when learning multi-view group representations, thus capturing diversified member weights and multifaceted group characteristics. In this way, MMAN can further mimic the mutual and multiple interactions between groups. We conduct experiments on three datasets, including two academic group link prediction datasets and one bundle-to-group recommendation dataset. The results demonstrate that the proposed approach can achieve superior performance on both tasks compared with plain GNN-based methods and other aggregating methods.

The application of social network has produced a large amount of entity data in different formats, which accompanied by problems such as data offset and attribute missing. The existing research on dealing with multiple data scenarios and accuracy performance is insufficient. To solve the problem of data cleaning, EDCleaner is carried out on transforming entity information into structured data with attribute labeling. The method of attribute recognition and data normalization for semi-structured data is proposed in EDCleaner, which efficiently identifies the attribute tag relationship of data and obtains the structured data with uniform specifications. Furthermore, a data cleaning model with active learning extension is established. The machine learning classifier is used to further improve the accuracy of attribute recognition, and finally form an efficient and accurate data cleaning method. Experimental results show that EDCleaner improves the cleaning accuracy and other performing indicators of entity information and exceeds the level of state of the art.