Detecting distance-based outliers in streams of data
Open Access
- 6 November 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 811-820
Abstract
In this work a method for detecting distance-based outliers in data streams is presented. We deal with the sliding window model, where outlier queries are performed in order to detect anomalies in the current window. Two algorithms are presented. The first one exactly answers outlier queries, but has larger space requirements. The second algorithm is directly derived from the exact one, has limited memory requirements and returns an approximate answer based on accurate estimations with a statistical guarantee. Several experiments have been accomplished, confirming the effectiveness of the proposed approach and the high quality of approximate solutions.Keywords
This publication has 16 references indexed in Scilit:
- On Abnormality Detection in Spuriously Populated Data Streams2005
- Mining distance-based outliers in near linear time with randomization and a simple pruning rule2003
- Issues in data stream managementACM SIGMOD Record, 2003
- A Comparative Study of Anomaly Detection Schemes in Network Intrusion Detection2003
- Searching in metric spacesACM Computing Surveys, 2001
- Outlier detection for high dimensional data2001
- Efficient algorithms for mining outliers from large data sets2000
- LOF2000
- Distance-based outliers: algorithms and applicationsThe VLDB Journal, 2000
- The R*-tree: an efficient and robust access method for points and rectangles1990