Scholarlink

<p>In recent years, Graph Neural Network (GNN)–based anomaly detection has been widely applied to identify fraudulent or abnormal behaviors in complex relational ecosystems, such as e-commerce platforms and online review networks. Despite their popularity, conventional GNNs often struggle to generalize in these settings due to noisy and imbalanced data, limited supervision, and the implicit assumption of homogeneity. However, it is well known that the presence of anomalies typically disrupts this homogeneity and leads to a heterophilic eigenvalue distribution, which further degrades the performance of standard GNN architectures in the anomaly detection context. To address these limitations, we introduce <span>CaRgo</span>, a <b>C</b>onstr<b>a</b>stive <b>R</b>epresentation Learnin<b>g</b> framework for An<b>o</b>maly Detection in Multi-Relational Graphs. The proposed model integrates contrastive learning with multi-relational message passing to enhance both the robustness and discriminative power of learned representations. Specifically, we use a relation-aware polynomial convolution mechanism to capture heterogeneous dependencies across different entity types, and we formulate a self-supervised contrastive objective that promotes consistency in node embeddings across perturbed views of the graph. By jointly optimizing supervised and contrastive losses, <span>CaRgo</span> learns more informative and stable representations, even in scenarios with limited or noisy labels. Extensive experiments on two real-world datasets, Amazon and Yelp, demonstrate that our approach outperforms state-of-the-art baselines. These results highlight the effectiveness of contrastive learning as a strong inductive bias for detecting complex anomalous patterns in multi-relational graphs.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

CaRgo: contrastive representation learning for anomaly detection in multi-relational graphs

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年6月18日

查看全文
  • Melike Yildiz Aktas,
  • Mustafa Coskun,
  • Chang-Tien Lu

摘要

In recent years, Graph Neural Network (GNN)–based anomaly detection has been widely applied to identify fraudulent or abnormal behaviors in complex relational ecosystems, such as e-commerce platforms and online review networks. Despite their popularity, conventional GNNs often struggle to generalize in these settings due to noisy and imbalanced data, limited supervision, and the implicit assumption of homogeneity. However, it is well known that the presence of anomalies typically disrupts this homogeneity and leads to a heterophilic eigenvalue distribution, which further degrades the performance of standard GNN architectures in the anomaly detection context. To address these limitations, we introduce CaRgo, a Constrastive Representation Learning framework for Anomaly Detection in Multi-Relational Graphs. The proposed model integrates contrastive learning with multi-relational message passing to enhance both the robustness and discriminative power of learned representations. Specifically, we use a relation-aware polynomial convolution mechanism to capture heterogeneous dependencies across different entity types, and we formulate a self-supervised contrastive objective that promotes consistency in node embeddings across perturbed views of the graph. By jointly optimizing supervised and contrastive losses, CaRgo learns more informative and stable representations, even in scenarios with limited or noisy labels. Extensive experiments on two real-world datasets, Amazon and Yelp, demonstrate that our approach outperforms state-of-the-art baselines. These results highlight the effectiveness of contrastive learning as a strong inductive bias for detecting complex anomalous patterns in multi-relational graphs.