Adaptive Graph Convolution and Semantic-Guided Attention for Multimodal Risk Detection in Social Networks

• URL: http://arxiv.org/abs/2509.16936v1
• Date: Sun, 21 Sep 2025 06:03:18 GMT
• Title: Adaptive Graph Convolution and Semantic-Guided Attention for Multimodal Risk Detection in Social Networks
• Authors: Cuiqianhe Du, Chia-En Chiang, Tianyi Huang, Zikun Cui,
• Abstract summary: This paper focuses on the detection of potentially dangerous tendencies of social media users in an innovative multimodal way.<n>We integrate Natural Language Processing (NLP) and Graph Neural Networks (GNNs) together.<n>Our experiments on real social media datasets from different platforms show that our model can achieve significant improvement over single-modality methods.
• Score: 1.1637069058198866
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper focuses on the detection of potentially dangerous tendencies of social media users in an innovative multimodal way. We integrate Natural Language Processing (NLP) and Graph Neural Networks (GNNs) together. Firstly, we apply NLP on the user-generated text and conduct semantic analysis, sentiment recognition and keyword extraction to get subtle risk signals from social media posts. Meanwhile, we build a heterogeneous user relationship graph based on social interaction and propose a novel relational graph convolutional network to model user relationship, attention relationship and content dissemination path to discover some important structural information and user behaviors. Finally, we combine textual features extracted from these two models above with graph structural information, which provides a more robust and effective way to discover at-risk users. Our experiments on real social media datasets from different platforms show that our model can achieve significant improvement over single-modality methods.

Related papers

• Socially Aware Music Recommendation: A Multi-Modal Graph Neural Networks for Collaborative Music Consumption and Community-Based Engagement [0.0]
  This study presents a novel Multi-Modal Graph Neural Network (MM-GNN) framework for socially aware music recommendation.<n>The proposed model introduces a fusion-free deep mutual learning strategy that aligns modality-specific representations from lyrics, audio, and visual data.<n>Emotion-aware embeddings derived from acoustic and textual signals contribute to emotionally aligned recommendations.
  arXiv  Detail & Related papers  (2025-09-13T02:04:39Z)
• LLMs Between the Nodes: Community Discovery Beyond Vectors [0.6445605125467574]
  Community detection in social network graphs plays a vital role in uncovering group dynamics, influence pathways, and the spread of information.<n>Recent advancements in Large Language Models (LLMs) open up new avenues for integrating semantic and contextual information into this task.<n>We introduce a two-step framework called CommLLM, which leverages the GPT-4o model along with prompt-based reasoning to fuse language model outputs with graph structure.
  arXiv  Detail & Related papers  (2025-07-29T20:47:54Z)
• Link Prediction for Social Networks using Representation Learning and Heuristic-based Features [1.279952601030681]
  Predicting missing links in social networks efficiently can help in various modern-day business applications. Here, we explore various feature extraction techniques to generate representations of nodes and edges in a social network.
  arXiv  Detail & Related papers  (2024-03-13T15:23:55Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Evidential Temporal-aware Graph-based Social Event Detection via Dempster-Shafer Theory [76.4580340399321]
  We propose ETGNN, a novel Evidential Temporal-aware Graph Neural Network. We construct view-specific graphs whose nodes are the texts and edges are determined by several types of shared elements respectively. Considering the view-specific uncertainty, the representations of all views are converted into mass functions through evidential deep learning (EDL) neural networks.
  arXiv  Detail & Related papers  (2022-05-24T16:22:40Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• Knowledge-aware Coupled Graph Neural Network for Social Recommendation [29.648300580880683]
  We propose a Knowledge-aware Coupled Graph Neural Network (KCGN) that injects the inter-dependent knowledge across items and users into the recommendation framework. KCGN enables the high-order user- and item-wise relation encoding by exploiting the mutual information for global graph structure awareness. We further augment KCGN with the capability of capturing dynamic multi-typed user-item interactive patterns.
  arXiv  Detail & Related papers  (2021-10-08T09:13:51Z)
• Social Recommendation with Self-Supervised Metagraph Informax Network [21.41026069530997]
  We propose a Self-Supervised Metagraph Infor-max Network (SMIN) which investigates the potential of incorporating social- and knowledge-aware relational structures into the user preference representation for recommendation. To inject high-order collaborative signals, we generalize the mutual information learning paradigm under the self-supervised graph-based collaborative filtering. Experimental results on several real-world datasets demonstrate the effectiveness of our SMIN model over various state-of-the-art recommendation methods.
  arXiv  Detail & Related papers  (2021-10-08T08:18:37Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)
• Graph-based Modeling of Online Communities for Fake News Detection [23.12016616717835]
  We propose a novel social context-aware fake news detection framework, based on graph neural networks (GNNs) The proposed framework aggregates information with respect to: 1) the nature of the content disseminated, 2) content-sharing behavior of users, and 3) the social network of those users. We empirically demonstrate that our framework yields significant improvements over existing text-based techniques and achieves state-of-the-art results on fake news datasets from two different domains.
  arXiv  Detail & Related papers  (2020-08-14T10:01:34Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

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.