Self-Trained One-class Classification for Unsupervised Anomaly Detection

• URL: http://arxiv.org/abs/2106.06115v1
• Date: Fri, 11 Jun 2021 01:36:08 GMT
• Title: Self-Trained One-class Classification for Unsupervised Anomaly Detection
• Authors: Jinsung Yoon, Kihyuk Sohn, Chun-Liang Li, Sercan O. Arik, Chen-Yu Lee, Tomas Pfister
• Abstract summary: Anomaly detection (AD) has various applications across domains, from manufacturing to healthcare. In this work, we focus on unsupervised AD problems whose entire training data are unlabeled and may contain both normal and anomalous samples. To tackle this problem, we build a robust one-class classification framework via data refinement. We show that our method outperforms state-of-the-art one-class classification method by 6.3 AUC and 12.5 average precision.
• Score: 56.35424872736276
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Anomaly detection (AD), separating anomalies from normal data, has various applications across domains, from manufacturing to healthcare. While most previous works have shown to be effective for cases with fully or partially labeled data, they are less practical for AD applications due to tedious data labeling processes. In this work, we focus on unsupervised AD problems whose entire training data are unlabeled and may contain both normal and anomalous samples. To tackle this problem, we build a robust one-class classification framework via data refinement. To refine the data accurately, we propose an ensemble of one-class classifiers, each of which is trained on a disjoint subset of training data. Moreover, we propose a self-training of deep representation one-class classifiers (STOC) that iteratively refines the data and deep representations. In experiments, we show the efficacy of our method for unsupervised anomaly detection on benchmarks from image and tabular data domains. For example, with a 10% anomaly ratio on CIFAR-10 data, the proposed method outperforms state-of-the-art one-class classification method by 6.3 AUC and 12.5 average precision.

Related papers

• Active anomaly detection based on deep one-class classification [9.904380236739398]
  We tackle two essential problems of active learning for Deep SVDD: query strategy and semi-supervised learning method. First, rather than solely identifying anomalies, our query strategy selects uncertain samples according to an adaptive boundary. Second, we apply noise contrastive estimation in training a one-class classification model to incorporate both labeled normal and abnormal data effectively.
  arXiv  Detail & Related papers  (2023-09-18T03:56:45Z)
• A Generic Machine Learning Framework for Fully-Unsupervised Anomaly Detection with Contaminated Data [0.0]
  We introduce a framework for a fully unsupervised refinement of contaminated training data for AD tasks. The framework is generic and can be applied to any residual-based machine learning model. We show its clear superiority over the naive approach of training with contaminated data without refinement.
  arXiv  Detail & Related papers  (2023-08-25T12:47:59Z)
• Anomaly Detection with Score Distribution Discrimination [4.468952886990851]
  We propose to optimize the anomaly scoring function from the view of score distribution. We design a novel loss function called Overlap loss that minimizes the overlap area between the score distributions of normal and abnormal samples.
  arXiv  Detail & Related papers  (2023-06-26T03:32:57Z)
• Zero-Shot Anomaly Detection via Batch Normalization [58.291409630995744]
  Anomaly detection plays a crucial role in many safety-critical application domains. The challenge of adapting an anomaly detector to drift in the normal data distribution has led to the development of zero-shot AD techniques. We propose a simple yet effective method called Adaptive Centered Representations (ACR) for zero-shot batch-level AD.
  arXiv  Detail & Related papers  (2023-02-15T18:34:15Z)
• Cluster-level pseudo-labelling for source-free cross-domain facial expression recognition [94.56304526014875]
  We propose the first Source-Free Unsupervised Domain Adaptation (SFUDA) method for Facial Expression Recognition (FER) Our method exploits self-supervised pretraining to learn good feature representations from the target data. We validate the effectiveness of our method in four adaptation setups, proving that it consistently outperforms existing SFUDA methods when applied to FER.
  arXiv  Detail & Related papers  (2022-10-11T08:24:50Z)
• Data-Efficient and Interpretable Tabular Anomaly Detection [54.15249463477813]
  We propose a novel framework that adapts a white-box model class, Generalized Additive Models, to detect anomalies. In addition, the proposed framework, DIAD, can incorporate a small amount of labeled data to further boost anomaly detection performances in semi-supervised settings.
  arXiv  Detail & Related papers  (2022-03-03T22:02:56Z)
• My Health Sensor, my Classifier: Adapting a Trained Classifier to Unlabeled End-User Data [0.5091527753265949]
  In this work, we present an approach for unsupervised domain adaptation (DA) with the constraint, that the labeled source data are not directly available. Our solution, iteratively labels only high confidence sub-regions of the target data distribution, based on the belief of the classifier. The goal is to apply the proposed approach on DA for the task of sleep apnea detection and achieve personalization based on the needs of the patient.
  arXiv  Detail & Related papers  (2020-09-22T20:27:35Z)
• Joint Visual and Temporal Consistency for Unsupervised Domain Adaptive Person Re-Identification [64.37745443119942]
  This paper jointly enforces visual and temporal consistency in the combination of a local one-hot classification and a global multi-class classification. Experimental results on three large-scale ReID datasets demonstrate the superiority of proposed method in both unsupervised and unsupervised domain adaptive ReID tasks.
  arXiv  Detail & Related papers  (2020-07-21T14:31:27Z)
• Clustering and Classification with Non-Existence Attributes: A Sentenced Discrepancy Measure Based Technique [0.0]
  Clustering approaches cannot be applied directly to such data unless pre-processing by techniques like imputation or marginalization. We have overcome this drawback by utilizing a Sentenced Discrepancy Measure which we refer to as the Attribute Weighted Penalty based Discrepancy (AWPD) This technique is designed to trace invaluable data to: directly apply our method on the datasets which have Non-Existence attributes and establish a method for detecting unstructured Non-Existence attributes with the best accuracy rate and minimum cost.
  arXiv  Detail & Related papers  (2020-02-24T17:56:06Z)
• Learning with Out-of-Distribution Data for Audio Classification [60.48251022280506]
  We show that detecting and relabelling certain OOD instances, rather than discarding them, can have a positive effect on learning. The proposed method is shown to improve the performance of convolutional neural networks by a significant margin.
  arXiv  Detail & Related papers  (2020-02-11T21:08:06Z)

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.