Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 427

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Enhancing one-class support vector machines for unsupervised anomaly detection

Amer, Mennatallah, Goldstein, Markus, Abdennadher, Slim·2013·Proceedings of the ACM SIGKDD Workshop on Outlier Detection and Description

Abstract

Support Vector Machines (SVMs) have been one of the most successful machine learning techniques for the past decade. For anomaly detection, also a semi-supervised variant, the one-class SVM, exists. Here, only normal data is required for training before anomalies can be detected. In theory, the one-class SVM could also be used in an unsupervised anomaly detection setup, where no prior training is conducted. Unfortunately, it turns out that a one-class SVM is sensitive to outliers in the data. In this work, we apply two modifications in order to make one-class SVMs more suitable for unsupervised anomaly detection: Robust one-class SVMs and eta one-class SVMs. The key idea of both modifications is, that outliers should contribute less to the decision boundary as normal instances. Experiments performed on datasets from UCI machine learning repository show that our modifications are very promising: Comparing with other standard unsupervised anomaly detection algorithms, the enhanced one-class SVMs are superior on two out of four datasets. In particular, the proposed eta one-class SVM has shown the most promising results.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2500853.2500857

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 32

  1. Amer Mennatallah, 2012, Proc. of the 3rd RapidMiner Community Meeting and Conference (RCOMM 2012, 1
  2. Fabrizio Angiulli and Clara Pizzuti . Fast outlier detection in high dimensional spaces. In Tapio Elomaa Heikki Mannila and Hannu Toivonen editors Principles of Data Mining and Knowledge Discovery volume 2431 of Lecture Notes in Computer Science pages 43 -- 78 . Springer 2002 . Fabrizio Angiulli and Clara Pizzuti. Fast outlier detection in high dimensional spaces. In Tapio Elomaa Heikki Mannila and Hannu Toivonen editors Principles of Data Mining and Knowledge Discovery volume 2431 of Lecture Notes in Computer Science pages 43--78. Springer 2002.
  3. 10.1109/CVPR.2008.4587510 · DOI · Paper page
  4. Christopher M. Bishop. Pattern Recognition and Machine Learning (Information Science and Statistics). Springer 1st ed. 2006. corr. 2nd printing 2011 edition October 2007. Christopher M. Bishop. Pattern Recognition and Machine Learning (Information Science and Statistics) . Springer 1st ed. 2006. corr. 2nd printing 2011 edition October 2007.
  5. 10.1023/A:1009715923555 · DOI · Paper page
  6. 10.1145/1541880.1541882 · DOI · Paper page
  7. 10.5555/1776814.1776844 · doi:10.5555/1776814.1776844
  8. Goldstein Markus, 2012, Histogram-based outlier score (hbos): A fast unsupervised anomaly detection algorithm. In Stefan Wölfl, editor, KI-2012: Poster and Demo Track, pages 59--63, Online, 9
  9. 10.5555/646111.679466 · doi:10.5555/646111.679466
  10. 10.1016/S0167-8655(03)00003-5 · DOI · Paper page
  11. Hu W. J., 2004, An accelerated decomposition algorithm for robust support vector machines. Circuits and Systems II: Express Briefs, IEEE Transactions on, 51, 234
  12. 10.1007/11731139_68 · DOI · Paper page
  13. 10.1145/1645953.1646195 · DOI · Paper page
  14. 10.1515/PIKO.2004.228 · DOI
  15. 10.1109/CBMS.2005.34 · DOI
  16. 10.1109/ICPR.2006.799 · DOI
  17. 10.1145/1150402.1150531 · DOI · Paper page
  18. 10.1109/IJCNN.2002.1007774 · DOI · Paper page
  19. Papadimitriou Spiros, 2003, Int. Conf. on, 0: 315
  20. Portnoy Leonid, 2001, In Proc. of ACM CSS Workshop on Data Mining Applied to Security (DMSA-2001), 5
  21. Schölkopf Bernhard, 1999, Advances in Neural Information Processing Systems 12, (NIPS) Conf., 582
  22. 10.1109/TSMCC.2002.807277 · DOI · Paper page
  23. Tang Jian, 2002, Ming-Syan Chen, 535, 10.1007/3-540-47887-6_53 · DOI · Paper page
  24. 10.1016/S0167-8655(99)00087-2 · DOI · Paper page
  25. 10.1109/ICDAR.2011.66 · doi:10.1109/icdar.2011.66
  26. Vapnik V., 1963, Pattern recognition using generalized portrait method, Automation and Remote Control, 24, 774
  27. Vladimir N. Vapnik. Statistical learning theory. Wiley 1 edition September 1998. Vladimir N. Vapnik. Statistical learning theory . Wiley 1 edition September 1998.
  28. 10.1016/S0925-2312(02)00632-X · DOI · Paper page
  29. Xu Linli, 2006, Proc. of the National Conf. On Artificial Intelligence, 536
  30. Yuille Alan, 2002, Advances in Neural Information Processing Systems 14
  31. 10.5555/1756006.1756041 · doi:10.5555/1756006.1756041
  32. 10.1631/jzus.C1000361 · DOI

Cited by

See all 427

Metadata

Authors
Amer, M., Goldstein, M., & Abdennadher, S.
Venue
Proceedings of the ACM SIGKDD Workshop on Outlier Detection and Description
Publisher
ACM
Published
2013-08-11
Pages
8-15
OpenAlex
W2134490011
Cited by
427
References
5
FWCI
10.19
Type
conference paper
Language
en
Open access
closed
Funders
Stiftung Rheinland-Pfalz für Innovation (961-38 6261/1039)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Enhancing one-class support vector machines for unsupervised anomaly detection. https://app.cochat.ai/papers/10.1145/2500853.2500857
The paper
Amer, M., Goldstein, M., & Abdennadher, S. (2013). Enhancing one-class support vector machines for unsupervised anomaly detection. Proceedings of the ACM SIGKDD Workshop on Outlier Detection and Description. https://doi.org/10.1145/2500853.2500857

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.