Fast Detection of Outliers in Data Streams with the Q_n Estimator

10/06/2019
by   Massimo Cafaro, et al.
0

We present FQN (Fast Q_n), a novel algorithm for fast detection of outliers in data streams. The algorithm works in the sliding window model, checking if an item is an outlier by cleverly computing the Q_n scale estimator in the current window. We thoroughly compare our algorithm for online Q_n with the state of the art competing algorithm by Nunkesser et al, and show that FQN (i) is faster, (ii) its computational complexity does not depend on the input distribution and (iii) it requires less space. Extensive experimental results on synthetic datasets confirm the validity of our approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2021

k-Center Clustering with Outliers in the Sliding-Window Model

The k-center problem for a point set P asks for a collection of k congru...
research
02/27/2021

A Soft Method for Outliers Detection at the Edge of the Network

The combination of the Internet of Things and the Edge Computing gives m...
research
04/18/2020

UDDSketch: Accurate Tracking of Quantiles in Data Streams

We present UDDSketch (Uniform DDSketch), a novel sketch for fast and acc...
research
01/15/2019

Parameter Estimation in Abruptly Changing Dynamic Environments

Many real-life dynamical systems change abruptly followed by almost stat...
research
10/18/2021

Fast and Exact Outlier Detection in Metric Spaces: A Proximity Graph-based Approach

Distance-based outlier detection is widely adopted in many fields, e.g.,...
research
07/12/2018

Sliding window order statistics in sublinear space

We extend the multi-pass streaming model to sliding window problems, and...
research
07/11/2019

Model based Level Shift Detection in Autocorrelated Data Streams using a moving window

Standard Control Chart techniques to detect level shift in data streams ...

Please sign up or login with your details

Forgot password? Click here to reset