Self-Organized Deviation Detection

• Main Author: Kreshchenko, Ivan
• Format: Others
• Language: English
• Published: Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE) 2008
• Subjects: Deviation detection; Feature extraction; Distance measure; Machine Learning
• Online Access: http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-1566

A technique to detect deviations in sets of systems in a self-organized way is described in this work. System features are extracted to allow compact representation of the system. Distances between systems are calculated by computing distances between the features. The distances are then stored in an affinity matrix. Deviating systems are detected by assuming a statistical model for the affinities. The key idea is to extract features and and identify deviating systems in a self-organized way, using nonlinear techniques for the feature extraction. The results are compared with those achieved with linear techniques, (principal component analysis). The features are computed with principal curves and an isometric feature mapping. In the case of principal curves the feature is the curve itself. In the case of isometric feature mapping is the feature a set of curves in the embedding space. The similarity measure between two representations is either the Hausdorff distance, or the Frechet distance. The deviation detection is performed by computing the probability of each system to be observed given all the other systems. To perform reliable inference the Bootstrapping technique was used. The technique is demonstrated on simulated and on-road vehicle cooling system data. The results show the applicability and comparison with linear techniques.