mlsanityData to 7 Oct 2026

An Efficient One-Class SVM for Anomaly Detection in the Internet of Things

arXiv 2104.11146 ↗First posted 22 Apr 2021cs.NI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Insecure Internet of things (IoT) devices pose significant threats to critical infrastructure and the Internet at large; detecting anomalous behavior from these devices remains of critical importance, but fast, efficient, accurate anomaly detection (also called "novelty detection") for these classes of devices remains elusive. One-Class Support Vector Machines (OCSVM) are one of the state-of-the-art approaches for novelty detection (or anomaly detection) in machine learning, due to their flexibility in fitting complex nonlinear boundaries between normal and novel data. IoT devices in smart homes and cities and connected building infrastructure present a compelling use case for novelty detection with OCSVM due to the variety of devices, traffic patterns, and types of anomalies that can manifest in such environments. Much previous research has thus applied OCSVM to novelty detection for IoT. Unfortunately, conventional OCSVMs introduce significant memory requirements and are computationally expensive at prediction time as the size of the train set grows, requiring space and time that scales with the number of training points. These memory and computational constraints can be prohibitive in practical, real-world deployments, where large training sets are typically needed to develop accurate models when fitting complex decision boundaries. In this work, we extend so-called Nystr"om and (Gaussian) Sketching approaches to OCSVM, by combining these methods with clustering and Gaussian mixture models to achieve significant speedups in prediction time and space in various IoT settings, without sacrificing detection accuracy.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 6 of its 33 references that are in the map. First posted on arXiv 22 Apr 2021.

Builds on

6 of 33 references.

References · 6

  1. 2015Less is More: Nystr"om Computational Regularizationcited by 89
  2. 2015Randomized sketches for kernels: Fast and optimal non-parametric regressioncited by 31
  3. 2018Machine learning for Internet of Things data analysis: A surveycited by 29
  4. 2018Quickshift++: Provably Good Initializations for Sample-Based Mean Shiftcited by 14
  5. 2019Statistical and Computational Trade-Offs in Kernel K-Meanscited by 7
  6. 2019Gaussian Sketching yields a J-L Lemma in RKHScited by 6

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 2.

3 papers.