AP-GCL: Adversarial Perturbation on Graph Contrastive Learning

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A serious ecological hazard of illegal transactions (money laundering, financial fraud, etc.) on the Bitcoin trading network. Anti-money laundering and fraud detection are essential instruments to address the problem. However, such datasets are generally extremely unbalanced in terms of positive and negative samples, and most of the data are unlabelled, with the illegal class accounting for just a minimal fraction of the total, which prevents supervised learning from learning a well-represented feature. We propose a self-supervised learning framework based on contrastive learning, in which two different augmented transformations are applied to the original graph data, perturbations are randomly attached to the node features of the upgraded views, and the model parameters and perturbations are updated by gradient descent to maximize the consistency of the single node in different views. The experimental result demonstrates that our model achieves excellent performance in all metrics and is comparable to supervised methods, which verifies the efficiency of the perturbation-based contrastive learning model.

Cite

CITATION STYLE

APA

Zheng, Z. Y., Chen, H. R., & Peng, K. (2023). AP-GCL: Adversarial Perturbation on Graph Contrastive Learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13655 LNCS, pp. 624–633). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-20096-0_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free