Abstract
Kernel principal component analysis and the reconstruction error is an effective anomaly detection technique for non-linear data sets. In an environment where a phenomenon is generating data that is non-stationary, anomaly detection requires a recomputation of the kernel eigenspace in order to represent the current data distribution. Recomputation is a computationally complex operation and reducing computational complexity is therefore a key challenge. In this paper, we propose an algorithm that is able to accurately remove data from a kernel eigenspace without performing a batch recomputation. Coupled with a kernel eigenspace update, we demonstrate that our technique is able to remove and add data to a kernel eigenspace more accurately than existing techniques. An adaptive version determines an appropriately sized sliding window of data and when a model update is necessary. Experimental evaluations on both synthetic and real-world data sets demonstrate the superior performance of the proposed approach in comparison to alternative incremental KPCA approaches and alternative anomaly detection techniques.
| Original language | English |
|---|---|
| Article number | 6817594 |
| Pages (from-to) | 3-16 |
| Number of pages | 14 |
| Journal | IEEE Transactions on Knowledge and Data Engineering |
| Volume | 27 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2015 |
| Externally published | Yes |
Keywords
- Adaptive
- Anomaly detection
- Kernel methods
- Kernel principal component analysis
- Non-stationary
- Outlier detection
Fingerprint
Dive into the research topics of 'Adaptive anomaly detection with kernel eigenspace splitting and merging'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver