paper-with-me

Papers

Infinite-dimensional Mahalanobis Distance with Applications to Kernelized Novelty Detection

2024-07-16 · Nikita Zozoulenko, Thomas Cass, Lukas Gonon

The Mahalanobis distance is a classical tool used to measure the covariance-adjusted distance between points in $\bbR^d$. In this work, we extend the concept of Mahalanobis distance to separable Banach spaces by reinterpreting it as a Cameron-Martin norm associated with a probability measure. This approach leads to a basis-free, data-driven notion of anomaly distance through the so-called variance norm, which can naturally be estimated using empirical measures of a sample. Our framework generalizes the classical $\bbR^d$, functional $(L^2[0,1])^d$, and kernelized settings; importantly, it incorporates non-injective covariance operators. We prove that the variance norm is invariant under invertible bounded linear transformations of the data, extending previous results which are limited to unitary operators. In the Hilbert space setting, we connect the variance norm to the RKHS of the covariance operator and establish consistency and convergence results for estimation using empirical measures. Using the variance norm, we introduce the notion of a kernelized nearest-neighbour Mahalanobis distance. In an empirical study on 12 real-world data sets, we demonstrate that the kernelized nearest-neighbour Mahalanobis distance outperforms the traditional kernelized Mahalanobis distance for multivariate time series novelty detection, using state-of-the-art time series kernels such as the signature, global alignment, and Volterra reservoir kernels.

📄 PDF Abstract BibTeX arXiv:2407.11873

Code (1)

nikitazozoulenko/kernel-timeseries-anomaly-detection 공식 구현 pytorch

Tasks

Anomaly DetectionNovelty DetectionSemi-supervised Anomaly DetectionSupervised Anomaly DetectionTime SeriesTime Series Anomaly Detection

Similar Papers 제목 키워드 기반

Local Distance Metric Learning for Nearest Neighbor Algorithm

2018-03-05 · Hossein Rajabzadeh, Mansoor Zolghadri Jahromi, Mohammad Sadegh Zare, Mostafa Fakhrahmad

Distance metric learning is a successful way to enhance the performance of the nearest neighbor classifier. In most cases, however, the distribution of data does not obey a regular form and may change in different parts …

Metric Learning

Kernel t-distributed stochastic neighbor embedding

2023-07-13 · Denis C. Ilie-Ablachim, Bogdan Dumitrescu, Cristian Rusu

This paper presents a kernelized version of the t-SNE algorithm, capable of mapping high-dimensional data to a low-dimensional space while preserving the pairwise distances between the data points in a non-Euclidean metr…

Clustering

Generalized infinite dimensional Alpha-Procrustes based geometries

2025-11-12 · Salvish Goomanee, Andi Han, Pratik Jawanpuria, Bamdev Mishra arxiv

This work extends the recently introduced Alpha-Procrustes family of Riemannian metrics for symmetric positive definite (SPD) matrices by incorporating generalized versions of the Bures-Wasserstein (GBW), Log-Euclidean, …

Dimensionless Anomaly Detection on Multivariate Streams with Variance Norm and Path Signature

2020-06-05 · Zhen Shao, Ryan Sze-Yin Chan, Thomas Cochrane, Peter Foster 외

In this paper, we propose a dimensionless anomaly detection method for multivariate streams. Our method is independent of the unit of measurement for the different stream channels, therefore dimensionless. We first propo…

Anomaly DetectionTime SeriesTime Series Analysis

The Mahalanobis distance for functional data with applications to classification

2013-04-17 · Esdras Joseph, Pedro Galeano, Rosa E. Lillo

This paper presents a general notion of Mahalanobis distance for functional data that extends the classical multivariate concept to situations where the observed data are points belonging to curves generated by a stochas…

ClassificationGeneral Classification