Deep Dual Support Vector Data Description for Anomaly Detection on Attributed Networks

• URL: http://arxiv.org/abs/2109.00138v1
• Date: Wed, 1 Sep 2021 01:21:06 GMT
• Title: Deep Dual Support Vector Data Description for Anomaly Detection on Attributed Networks
• Authors: Fengbin Zhang, Haoyi Fan, Ruidong Wang, Zuoyong Li, Tiancai Liang
• Abstract summary: We propose an end-to-end model of Deep Dual Support Vector Data description based Autoencoder (Dual-SVDAE) for anomaly detection on attributed networks. Specifically, Dual-SVDAE consists of a structure autoencoder and an attribute autoencoder to learn the latent representation of the node in the structure space and attribute space respectively. Experiments on the real-world attributed networks show that Dual-SVDAE consistently outperforms the state-of-the-arts.
• Score: 7.299729677753102
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Networks are ubiquitous in the real world such as social networks and communication networks, and anomaly detection on networks aims at finding nodes whose structural or attributed patterns deviate significantly from the majority of reference nodes. However, most of the traditional anomaly detection methods neglect the relation structure information among data points and therefore cannot effectively generalize to the graph structure data. In this paper, we propose an end-to-end model of Deep Dual Support Vector Data description based Autoencoder (Dual-SVDAE) for anomaly detection on attributed networks, which considers both the structure and attribute for attributed networks. Specifically, Dual-SVDAE consists of a structure autoencoder and an attribute autoencoder to learn the latent representation of the node in the structure space and attribute space respectively. Then, a dual-hypersphere learning mechanism is imposed on them to learn two hyperspheres of normal nodes from the structure and attribute perspectives respectively. Moreover, to achieve joint learning between the structure and attribute of the network, we fuse the structure embedding and attribute embedding as the final input of the feature decoder to generate the node attribute. Finally, abnormal nodes can be detected by measuring the distance of nodes to the learned center of each hypersphere in the latent structure space and attribute space respectively. Extensive experiments on the real-world attributed networks show that Dual-SVDAE consistently outperforms the state-of-the-arts, which demonstrates the effectiveness of the proposed method.

Related papers

• HACD: Harnessing Attribute Semantics and Mesoscopic Structure for Community Detection [3.389327931408283]
  Community detection plays a pivotal role in uncovering closely connected subgraphs. Previous research has effectively leveraged network topology and attribute information for attributed community detection. We propose HACD, a novel attributed community detection model based on heterogeneous graph attention networks.
  arXiv  Detail & Related papers  (2024-11-04T10:16:59Z)
• 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)
• Deep Embedded Clustering with Distribution Consistency Preservation for Attributed Networks [15.895606627146291]
  In this study, we propose an end-to-end deep embedded clustering model for attributed networks. It utilizes graph autoencoder and node attribute autoencoder to respectively learn node representations and cluster assignments. The proposed model achieves significantly better or competitive performance compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-28T02:35:34Z)
• 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)
• GAGE: Geometry Preserving Attributed Graph Embeddings [34.25102483600248]
  This paper presents a novel approach for node embedding in attributed networks. It preserves the distances of both the connections and the attributes. An effective and lightweight algorithm is developed to tackle the learning task.
  arXiv  Detail & Related papers  (2020-11-03T02:07:02Z)
• Dual-constrained Deep Semi-Supervised Coupled Factorization Network with Enriched Prior [80.5637175255349]
  We propose a new enriched prior based Dual-constrained Deep Semi-Supervised Coupled Factorization Network, called DS2CF-Net. To ex-tract hidden deep features, DS2CF-Net is modeled as a deep-structure and geometrical structure-constrained neural network. Our network can obtain state-of-the-art performance for representation learning and clustering.
  arXiv  Detail & Related papers  (2020-09-08T13:10:21Z)
• Decoupled Variational Embedding for Signed Directed Networks [39.3449157396596]
  We propose to learn more representative node embeddings by simultaneously capturing the first-order and high-order topology in signed directed networks. In particular, we reformulate the representation learning problem on signed directed networks from a variational auto-encoding perspective. Extensive experiments are conducted on three widely used real-world datasets.
  arXiv  Detail & Related papers  (2020-08-28T02:48:15Z)
• Suppress and Balance: A Simple Gated Network for Salient Object Detection [89.88222217065858]
  We propose a simple gated network (GateNet) to solve both issues at once. With the help of multilevel gate units, the valuable context information from the encoder can be optimally transmitted to the decoder. In addition, we adopt the atrous spatial pyramid pooling based on the proposed "Fold" operation (Fold-ASPP) to accurately localize salient objects of various scales.
  arXiv  Detail & Related papers  (2020-07-16T02:00:53Z)
• BiDet: An Efficient Binarized Object Detector [96.19708396510894]
  We propose a binarized neural network learning method called BiDet for efficient object detection. Our BiDet fully utilizes the representational capacity of the binary neural networks for object detection by redundancy removal. Our method outperforms the state-of-the-art binary neural networks by a sizable margin.
  arXiv  Detail & Related papers  (2020-03-09T08:16:16Z)
• Cross-layer Feature Pyramid Network for Salient Object Detection [102.20031050972429]
  We propose a novel Cross-layer Feature Pyramid Network to improve the progressive fusion in salient object detection. The distributed features per layer own both semantics and salient details from all other layers simultaneously, and suffer reduced loss of important information.
  arXiv  Detail & Related papers  (2020-02-25T14:06:27Z)
• AnomalyDAE: Dual autoencoder for anomaly detection on attributed networks [10.728863198129478]
  Anomaly detection on attributed networks aims at finding nodes whose patterns deviate significantly from the majority of reference nodes. We propose a deep joint representation learning framework for anomaly detection through a dual autoencoder (AnomalyDAE) Anomaly can be detected by measuring the reconstruction errors of nodes from both the structure and attribute perspectives.
  arXiv  Detail & Related papers  (2020-02-10T11:32:23Z)

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.