SCALA: Sparsification-based Contrastive Learning for Anomaly Detection on Attributed Networks

• URL: http://arxiv.org/abs/2401.01625v2
• Date: Mon, 8 Jan 2024 09:31:03 GMT
• Title: SCALA: Sparsification-based Contrastive Learning for Anomaly Detection on Attributed Networks
• Authors: Enbo He, Yitong Hao, Yue Zhang, Guisheng Yin and Lina Yao
• Abstract summary: Anomaly detection on attributed networks aims to find the nodes whose behaviors are significantly different from other majority nodes. We present a novel contrastive learning framework for anomaly detection on attributed networks, textbfSCALA, aiming to improve the embedding quality of the network. Extensive experiments are conducted on five benchmark real-world datasets and the results show that SCALA consistently outperforms all baseline methods significantly.
• Score: 19.09775548036214
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Anomaly detection on attributed networks aims to find the nodes whose behaviors are significantly different from other majority nodes. Generally, network data contains information about relationships between entities, and the anomaly is usually embodied in these relationships. Therefore, how to comprehensively model complex interaction patterns in networks is still a major focus. It can be observed that anomalies in networks violate the homophily assumption. However, most existing studies only considered this phenomenon obliquely rather than explicitly. Besides, the node representation of normal entities can be perturbed easily by the noise relationships introduced by anomalous nodes. To address the above issues, we present a novel contrastive learning framework for anomaly detection on attributed networks, \textbf{SCALA}, aiming to improve the embedding quality of the network and provide a new measurement of qualifying the anomaly score for each node by introducing sparsification into the conventional method. Extensive experiments are conducted on five benchmark real-world datasets and the results show that SCALA consistently outperforms all baseline methods significantly.

Related papers

• Alleviating Structural Distribution Shift in Graph Anomaly Detection [70.1022676681496]
  Graph anomaly detection (GAD) is a challenging binary classification problem. Gallon neural networks (GNNs) benefit the classification of normals from aggregating homophilous neighbors. We propose a framework to mitigate the effect of heterophilous neighbors and make them invariant.
  arXiv  Detail & Related papers  (2024-01-25T13:07:34Z)
• ARISE: Graph Anomaly Detection on Attributed Networks via Substructure Awareness [70.60721571429784]
  We propose a new graph anomaly detection framework on attributed networks via substructure awareness (ARISE) ARISE focuses on the substructures in the graph to discern abnormalities. Experiments show that ARISE greatly improves detection performance compared to state-of-the-art attributed networks anomaly detection (ANAD) algorithms.
  arXiv  Detail & Related papers  (2022-11-28T12:17:40Z)
• Anomaly Detection in Multiplex Dynamic Networks: from Blockchain Security to Brain Disease Prediction [0.0]
  ANOMULY is an unsupervised edge anomaly detection framework for multiplex dynamic networks. We show how ANOMULY could be employed as a new tool to understand abnormal brain activity that might reveal a brain disease or disorder.
  arXiv  Detail & Related papers  (2022-11-15T18:25:40Z)
• Signed Network Embedding with Application to Simultaneous Detection of Communities and Anomalies [25.541992448747695]
  This paper develops a unified embedding model for signed networks to disentangle the intertwined balance structure and anomaly effect. The proposed model captures both balance structure and anomaly effect through a low rank plus sparse matrix decomposition. The advantage of the proposed embedding model is also demonstrated through extensive numerical experiments on both synthetic networks and an international relation network.
  arXiv  Detail & Related papers  (2022-07-08T03:58:56Z)
• Reconstruction Enhanced Multi-View Contrastive Learning for Anomaly Detection on Attributed Networks [35.93516937521393]
  This paper proposes a self-supervised learning framework that jointly optimize a multi-view contrastive learning-based module and an attribute reconstruction-based module to more accurately detect anomalies on attributed networks. Experiments conducted on five benchmark datasets show our model outperforms current state-of-the-art models.
  arXiv  Detail & Related papers  (2022-05-10T11:35:32Z)
• Predicting Unreliable Predictions by Shattering a Neural Network [145.3823991041987]
  Piecewise linear neural networks can be split into subfunctions. Subfunctions have their own activation pattern, domain, and empirical error. Empirical error for the full network can be written as an expectation over subfunctions.
  arXiv  Detail & Related papers  (2021-06-15T18:34:41Z)
• Unveiling Anomalous Edges and Nominal Connectivity of Attributed Networks [53.56901624204265]
  The present work deals with uncovering anomalous edges in attributed graphs using two distinct formulations with complementary strengths. The first relies on decomposing the graph data matrix into low rank plus sparse components to improve markedly performance. The second broadens the scope of the first by performing robust recovery of the unperturbed graph, which enhances the anomaly identification performance.
  arXiv  Detail & Related papers  (2021-04-17T20:00:40Z)
• 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)
• Deep Weakly-supervised Anomaly Detection [118.55172352231381]
  Pairwise Relation prediction Network (PReNet) learns pairwise relation features and anomaly scores. PReNet can detect any seen/unseen abnormalities that fit the learned pairwise abnormal patterns. Empirical results on 12 real-world datasets show that PReNet significantly outperforms nine competing methods in detecting seen and unseen anomalies.
  arXiv  Detail & Related papers  (2019-10-30T00:40:25Z)

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.