mlsanityData to 14 Oct 2026

Deep Orthogonal Hypersphere Compression for Anomaly Detection

arXiv 2302.06430 ↗First posted 13 Feb 2023cs.LG cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Many well-known and effective anomaly detection methods assume that a reasonable decision boundary has a hypersphere shape, which however is difficult to obtain in practice and is not sufficiently compact, especially when the data are in high-dimensional spaces. In this paper, we first propose a novel deep anomaly detection model that improves the original hypersphere learning through an orthogonal projection layer, which ensures that the training data distribution is consistent with the hypersphere hypothesis, thereby increasing the true positive rate and decreasing the false negative rate. Moreover, we propose a bi-hypersphere compression method to obtain a hyperspherical shell that yields a more compact decision region than a hyperball, which is demonstrated theoretically and numerically. The proposed methods are not confined to common datasets such as image and tabular data, but are also extended to a more challenging but promising scenario, graph-level anomaly detection, which learns graph representation with maximum mutual information between the substructure and global structure features while exploring orthogonal single- or bi-hypersphere anomaly decision boundaries. The numerical and visualization results on benchmark datasets demonstrate the superiority of our methods in comparison to many baselines and state-of-the-art methods.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 21 of its 44 references that are in the map. First posted on arXiv 13 Feb 2023.

Builds on

21 of 44 references.

References · 21

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2018How Powerful are Graph Neural Networks?cited by 4,393
  4. 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
  5. 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
  6. 2019Deep Semi-Supervised Anomaly Detectioncited by 291
  7. 2022ADBench: Anomaly Detection Benchmarkcited by 232
  8. 2020Classification-Based Anomaly Detection for General Datacited by 211
  9. 2019OCGAN: One-class Novelty Detection Using GANs with Constrained Latent Representationscited by 199
  10. 2019A Survey on Graph Kernelscited by 148
  11. 2020Learning and Evaluating Representations for Deep One-class Classificationcited by 133
  12. 2020Explainable Deep One-Class Classificationcited by 127
9 more
  1. 2020DROCC: Deep Robust One-Class Classificationcited by 121
  2. 2021Deep One-Class Classification via Interpolated Gaussian Descriptorcited by 67
  3. 2021Deep Graph-level Anomaly Detection by Glocal Knowledge Distillationcited by 67
  4. 2018GraKeL: A Graph Kernel Library in Pythoncited by 54
  5. 2020On Using Classification Datasets to Evaluate Graph-Level Outlier Detection: Peculiar Observations and New Insightscited by 53
  6. 2022Raising the Bar in Graph-level Anomaly Detectioncited by 45
  7. 2020Explainable Classification of Brain Networks via Contrast Subgraphscited by 26
  8. 2022Perturbation Learning Based Anomaly Detectioncited by 24
  9. 2018Exactly Robust Kernel Principal Component Analysiscited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 7; 2026: 3.

12 papers.