Peer Disambiguation in Self-Reported Surveys using Graph Attention Networks

• URL: http://arxiv.org/abs/2503.20076v1
• Date: Tue, 25 Mar 2025 21:25:31 GMT
• Title: Peer Disambiguation in Self-Reported Surveys using Graph Attention Networks
• Authors: Ajitesh Srivastava, Aryan Shetty, Eric Rice,
• Abstract summary: This research demonstrates the potential of Graph Neural Networks (GNN) to advance real-world network data analysis.<n>By resolving ambiguities, we improve network accuracy, and in turn, improve suicide risk prediction.
• Score: 5.8302115161559565
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Studying peer relationships is crucial in solving complex challenges underserved communities face and designing interventions. The effectiveness of such peer-based interventions relies on accurate network data regarding individual attributes and social influences. However, these datasets are often collected through self-reported surveys, introducing ambiguities in network construction. These ambiguities make it challenging to fully utilize the network data to understand the issues and to design the best interventions. We propose and solve two variations of link ambiguities in such network data -- (i) which among the two candidate links exists, and (ii) if a candidate link exists. We design a Graph Attention Network (GAT) that accounts for personal attributes and network relationships on real-world data with real and simulated ambiguities. We also demonstrate that by resolving these ambiguities, we improve network accuracy, and in turn, improve suicide risk prediction. We also uncover patterns using GNNExplainer to provide additional insights into vital features and relationships. This research demonstrates the potential of Graph Neural Networks (GNN) to advance real-world network data analysis facilitating more effective peer interventions across various fields.

Related papers

• Causal GNNs: A GNN-Driven Instrumental Variable Approach for Causal Inference in Networks [0.0]
  CgNN is a novel approach to mitigate hidden confounder bias and improve causal effect estimation. Our results demonstrate that CgNN effectively mitigates hidden confounder bias and offers a robust GNN-driven IV framework for causal inference in complex network data.
  arXiv  Detail & Related papers  (2024-09-13T05:39:00Z)
• Uncertainty in Graph Neural Networks: A Survey [47.785948021510535]
  Graph Neural Networks (GNNs) have been extensively used in various real-world applications.<n>However, the predictive uncertainty of GNNs stemming from diverse sources can lead to unstable and erroneous predictions.<n>This survey aims to provide a comprehensive overview of the GNNs from the perspective of uncertainty.
  arXiv  Detail & Related papers  (2024-03-11T21:54:52Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Over-Squashing in Graph Neural Networks: A Comprehensive survey [0.0]
  This survey delves into the challenge of over-squashing in Graph Neural Networks (GNNs)<n>It comprehensively explores the causes, consequences, and mitigation strategies for over-squashing.<n>Various methodologies are reviewed, including graph rewiring, novel normalization, spectral analysis, and curvature-based strategies.<n>The survey also discusses the interplay between over-squashing and other GNN limitations, such as over-smoothing.
  arXiv  Detail & Related papers  (2023-08-29T18:46:15Z)
• BS-GAT Behavior Similarity Based Graph Attention Network for Network Intrusion Detection [20.287285893803244]
  This paper proposes a graph neural network algorithm based on behavior similarity (BS-GAT) using graph attention network. The results show that the proposed method is effective and has superior performance comparing to existing solutions.
  arXiv  Detail & Related papers  (2023-04-07T09:42:07Z)
• 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)
• 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)
• Adversarial Robustness of Probabilistic Network Embedding for Link Prediction [24.335469995826244]
  We study adversarial robustness of Conditional Network Embedding (CNE) for link prediction. We measure the sensitivity of the link predictions of the model to small adversarial perturbations of the network. Our approach allows one to identify the links and non-links in the network that are most vulnerable to such perturbations.
  arXiv  Detail & Related papers  (2021-07-05T11:07:35Z)
• Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning [50.24174211654775]
  We present a novel contrastive self-supervised learning framework for anomaly detection on attributed networks. Our framework fully exploits the local information from network data by sampling a novel type of contrastive instance pair. A graph neural network-based contrastive learning model is proposed to learn informative embedding from high-dimensional attributes and local structure.
  arXiv  Detail & Related papers  (2021-02-27T03:17:20Z)
• Discriminability of Single-Layer Graph Neural Networks [172.5042368548269]
  Graph neural networks (GNNs) have exhibited promising performance on a wide range of problems. We focus on the property of discriminability and establish conditions under which the inclusion of pointwise nonlinearities to a stable graph filter bank leads to an increased discriminative capacity for high-eigenvalue content.
  arXiv  Detail & Related papers  (2020-10-17T18:52:34Z)
• Joint Inference of Diffusion and Structure in Partially Observed Social Networks Using Coupled Matrix Factorization [3.399624105745357]
  In this paper, a model is learned from partially observed data to infer unobserved diffusion and structure networks. The interrelations among links of nodes and cascade processes are utilized in the proposed method via learning and low-dimensional latent factors. Experiments on these synthetic and real-world datasets show that the proposed method successfully detects invisible social behaviors, predicts links, and identifies latent features.
  arXiv  Detail & Related papers  (2020-10-03T17:48:57Z)
• Information Obfuscation of Graph Neural Networks [96.8421624921384]
  We study the problem of protecting sensitive attributes by information obfuscation when learning with graph structured data. We propose a framework to locally filter out pre-determined sensitive attributes via adversarial training with the total variation and the Wasserstein distance.
  arXiv  Detail & Related papers  (2020-09-28T17:55:04Z)
• Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction [69.1473775184952]
  We introduce a realistic problem of few-shot out-of-graph link prediction. We tackle this problem with a novel transductive meta-learning framework. We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
  arXiv  Detail & Related papers  (2020-06-11T17:42:46Z)

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.