Fence GAN: Towards Better Anomaly Detection
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Anomaly detection is a classical problem where the aim is to detect anomalous data that do not belong to the normal data distribution. Current state-of-the-art methods for anomaly detection on complex high-dimensional data are based on the generative adversarial network (GAN). However, the traditional GAN loss is not directly aligned with the anomaly detection objective: it encourages the distribution of the generated samples to overlap with the real data and so the resulting discriminator is ineffective as an anomaly detector. In this paper, we propose modifications to the GAN loss such that the generated samples lie at the boundaries of the real data distribution. With our modified GAN loss, our anomaly detection method, called Fence GAN (FGAN), directly uses the discriminator score as an anomaly threshold. Our experimental results on the MNIST, CIFAR10 and KDD99 datasets show that FGAN yields the best anomaly classification accuracy compared to state-of-the-art methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
U-Net: Convolutional Networks for Biomedical Image Segmentation
Ronneberger, O., Fischer, P., & Brox, T. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24574-4_28 · Cited by 99,404
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687 · cited 1×
“Anomaly detection is a well-known problem in artificial intelligence where one aims to identify anomalous instances that do not belong to the normal data distribution [5, 14].”
BackgroundEstimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 1×
“Traditional methods for anomaly detection include one-class SVM [26], nearest neighbor [9], clustering [28], kernel density estimation [21] and hidden markov models [13].”
MethodHawkins, D. M. (1980) · doi:10.1007/978-94-015-3994-4 · Cited by 2,982
Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery
Schlegl, T., Seeböck, P., Waldstein, S. M., Schmidt-Erfurth, U., & Langs, G. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-59050-9_12 · Cited by 2,627
Anomaly-based network intrusion detection: Techniques, systems and challenges
García-Teodoro, P., Díaz-Verdejo, J., Maciá-Fernández, G., & Vázquez, E. (2009) · Computers & Security · doi:10.1016/j.cose.2008.08.003 · Cited by 2,085
High-dimensional and large-scale anomaly detection using a linear one-class SVM with deep learning
Erfani, S. M., Rajasegarar, S., Karunasekera, S., & Leckie, C. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.03.028 · Cited by 1,162
A Geometric Framework for Unsupervised Anomaly Detection: Detecting Intrusions in Unlabeled Data
Eskin, E., Arnold, A., Prerau, M., Portnoy, L., & Stolfo, S. (2002) · Advances in Information Security · doi:10.1007/978-1-4615-0953-0_4 · Cited by 683 · cited 1×
“Traditional methods for anomaly detection include one-class SVM [26], nearest neighbor [9], clustering [28], kernel density estimation [21] and hidden markov models [13].”
MethodDeep Structured Energy Based Models for Anomaly Detection
Zhai, S., Cheng, Y., Lu, W., & Zhang, Z. (2016) · arXiv · doi:10.48550/arxiv.1605.07717 · Cited by 334 · cited 1×
“Values for OC-SVM, DSEBM, DAGMM were obtained from [33], [35].”
Method
Cited by
Deep Graph-level Anomaly Detection by Glocal Knowledge Distillation
Ma, R., Pang, G., Chen, L., & van den Hengel, A. (2022) · Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3488560.3498473 · Cited by 86
“Also, deep anomaly detection models, such as autoencoder (AE)-based methods [7, 11, 54], generative adversarial network (GAN)-based methods [24, 34] and one-class classifiers [31, 32, 53], have shown promising performance on different types of data (e.”
MethodMachine learning in NextG networks via generative adversarial networks
Ayanoglu, E., Davaslioglu, K., & Sagduyu, Y. E. (2022) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2022.3153004 · Cited by 55
Self-Supervised Learning for Anomaly Detection With Dynamic Local Augmentation
Yoa, S., Lee, S., Kim, C., & Kim, H. J. (2021) · IEEE Access · doi:10.1109/access.2021.3124525 · Cited by 38
Kotsiopoulos, T., Papakostas, G., Vafeiadis, T., Dimitriadis, V., Nizamis, A., Bolzoni, A., Bellinati, D., Ioannidis, D., Votis, K., Tzovaras, D., et al. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124839 · Cited by 19
Metadata
- Authors
- Ngo, P. C., Winarto, A. A., Kou, C. K. L., Park, S., Akram, F., & Lee, H. K.
- Venue
- 2019 IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI)
- Publisher
- IEEE
- Published
- 2019-11
- Pages
- 141-148
- ISSN
- 1082-3409 (ISSN-L)
- OpenAlex
- W3006520502
- Cited by
- 94
- References
- 10
- FWCI
- 5.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.