Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
404061 | Knowledge-Based Systems | 2008 | 6 Pages |
Abstract
Multivariate time series (MTS) samples which differ significantly from other MTS samples are referred to as outlier samples. In this paper, an algorithm designed to efficiently detect the top n outlier samples in MTS dataset, based on Solving Set, is proposed. An extended Frobenius Norm is used to compute the distance between MTS samples. The outlier score of MTS sample is the sum of the distances from its k nearest neighbors. The time complexity of the algorithm is subquadratic. We conduct experiments on two real-world datasets, stock market dataset and BCI (Brain Computer Interface) dataset. The experiment results show the efficiency and effectiveness of the algorithm.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Xiaoqing Weng, Junyi Shen,