Outlier detection is widely used in many data stream application, such as network intrusion detection, fraud detection, etc. However, most existing algorithms focused on detecting class outliers and there is little work on detecting attribute outliers, which considers the correlation or relevance among the data items. In this paper we study the problem of detecting attribute outliers within the sliding windows over data streams. An efficient algorithm is proposed to perform exact outlier detection. The algorithm relies on an efficient data structure, which stores only the necessary information and can perform updates incurred by data arrival and expiration with minimum cost. To address the problem of limited memory, we also present an approximate algorithm, which selectively drops data within the current window and at the same time maintains a maximum error bound. Extensive experiments are conducted and the results show that our algorithms are efficient and effective.
|Status||Udgivet - 2010|
|Begivenhed||International Conference on Database Systems for Advanced Applications (DASFAA 2010) - Ksukuba, Japan|
Varighed: 1. apr. 2010 → 4. apr. 2010
Konferencens nummer: 15
|Konference||International Conference on Database Systems for Advanced Applications (DASFAA 2010)|
|Periode||01/04/2010 → 04/04/2010|