DocumentCode
3166386
Title
Computing Correlation Anomaly Scores Using Stochastic Nearest Neighbors
Author
Ide, Tsuyoshi ; Papadimitriou, Spiros ; Vlachos, Michail
Author_Institution
IBM Res., Yamato
fYear
2007
fDate
28-31 Oct. 2007
Firstpage
523
Lastpage
528
Abstract
This paper addresses the task of change analysis of correlated multi-sensor systems. The goal of change analysis is to compute the anomaly score of each sensor when we know that the system has some potential difference from a reference state. Examples include validating the proper performance of various car sensors in the automobile industry. We solve this problem based on a neighborhood preservation principle - If the system is working normally, the neighborhood graph of each sensor is almost invariant against the fluctuations of experimental conditions. Here a neighborhood graph is defined based on the correlation between sensor signals. With the notion of stochastic neighborhood, our method is capable of robustly computing the anomaly score of each sensor under conditions that are hard to be detected by other naive methods.
Keywords
data mining; sensor fusion; stochastic processes; automobile industry; car sensors; change analysis; correlated multisensor systems; correlation anomaly scores computing; neighborhood graph; stochastic nearest neighbors; Automobiles; Data mining; Fluctuations; Laboratories; Nearest neighbor searches; Sensor systems; Signal analysis; Stochastic processes; USA Councils; Unsupervised learning;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on
Conference_Location
Omaha, NE
ISSN
1550-4786
Print_ISBN
978-0-7695-3018-5
Type
conf
DOI
10.1109/ICDM.2007.12
Filename
4470284
Link To Document