Unsupervised non-parametric change point detection in quasi-periodic signals

• URL: http://arxiv.org/abs/2002.02717v1
• Date: Fri, 7 Feb 2020 11:24:50 GMT
• Title: Unsupervised non-parametric change point detection in quasi-periodic signals
• Authors: Nikolay Shvetsov and Nazar Buzun and Dmitry V. Dylov
• Abstract summary: We propose a new unsupervised and non-parametric method to detect change points in quasi-periodic signals. The detection relies on optimal transport theory combined with topological analysis and the bootstrap procedure. We successfully find abnormal or irregular cardiac cycles in the waveforms for the six of the most frequent types of clinical arrhythmias.
• Score: 2.2758845733923687
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a new unsupervised and non-parametric method to detect change points in intricate quasi-periodic signals. The detection relies on optimal transport theory combined with topological analysis and the bootstrap procedure. The algorithm is designed to detect changes in virtually any harmonic or a partially harmonic signal and is verified on three different sources of physiological data streams. We successfully find abnormal or irregular cardiac cycles in the waveforms for the six of the most frequent types of clinical arrhythmias using a single algorithm. The validation and the efficiency of the method are shown both on synthetic and on real time series. Our unsupervised approach reaches the level of performance of the supervised state-of-the-art techniques. We provide conceptual justification for the efficiency of the method and prove the convergence of the bootstrap procedure theoretically.

Related papers

• Optimization of Iterative Blind Detection based on Expectation Maximization and Belief Propagation [29.114100423416204]
  We propose a blind symbol detection for block-fading linear inter-symbol channels. We design a joint channel estimation and detection scheme that combines the study expectation algorithm and the ubiquitous belief propagation algorithm. We show that the proposed method can learn efficient schedules that generalize well and even outperform coherent BP detection in high signal-to-noise scenarios.
  arXiv  Detail & Related papers  (2024-08-05T08:45:50Z)
• Partially-Observable Sequential Change-Point Detection for Autocorrelated Data via Upper Confidence Region [12.645304808491309]
  We propose a detection scheme called adaptive upper confidence region with state space model (AUCRSS) for sequential change point detection. A partially-observable Kalman filter algorithm is developed for online inference of SSM, and accordingly, a change point detection scheme based on a generalized likelihood ratio test is analyzed.
  arXiv  Detail & Related papers  (2024-03-30T02:32:53Z)
• Optimal Algorithms for the Inhomogeneous Spiked Wigner Model [89.1371983413931]
  We derive an approximate message-passing algorithm (AMP) for the inhomogeneous problem. We identify in particular the existence of a statistical-to-computational gap where known algorithms require a signal-to-noise ratio bigger than the information-theoretic threshold to perform better than random.
  arXiv  Detail & Related papers  (2023-02-13T19:57:17Z)
• Identifiability and Asymptotics in Learning Homogeneous Linear ODE Systems from Discrete Observations [114.17826109037048]
  Ordinary Differential Equations (ODEs) have recently gained a lot of attention in machine learning. theoretical aspects, e.g., identifiability and properties of statistical estimation are still obscure. This paper derives a sufficient condition for the identifiability of homogeneous linear ODE systems from a sequence of equally-spaced error-free observations sampled from a single trajectory.
  arXiv  Detail & Related papers  (2022-10-12T06:46:38Z)
• A Contrastive Approach to Online Change Point Detection [4.762323642506733]
  We suggest a novel procedure for online change point detection. Our approach expands an idea of maximizing a discrepancy measure between points from pre-change and post-change distributions. We prove non-asymptotic bounds on the average running length of the procedure and its expected detection delay.
  arXiv  Detail & Related papers  (2022-06-21T07:01:36Z)
• A Priori Denoising Strategies for Sparse Identification of Nonlinear Dynamical Systems: A Comparative Study [68.8204255655161]
  We investigate and compare the performance of several local and global smoothing techniques to a priori denoise the state measurements. We show that, in general, global methods, which use the entire measurement data set, outperform local methods, which employ a neighboring data subset around a local point.
  arXiv  Detail & Related papers  (2022-01-29T23:31:25Z)
• Mitigating the Mutual Error Amplification for Semi-Supervised Object Detection [92.52505195585925]
  We propose a Cross Teaching (CT) method, aiming to mitigate the mutual error amplification by introducing a rectification mechanism of pseudo labels. In contrast to existing mutual teaching methods that directly treat predictions from other detectors as pseudo labels, we propose the Label Rectification Module (LRM)
  arXiv  Detail & Related papers  (2022-01-26T03:34:57Z)
• Comparing Weak- and Unsupervised Methods for Resonant Anomaly Detection [0.38233569758620045]
  We compare the autoencoder (AE) and a weakly-supervised approach based on the Classification Without Labels (CWoLa) technique. CWoLa is effective at finding diverse and moderately rare signals while the AE can provide sensitivity to very rare signals, but only with certain topologies.
  arXiv  Detail & Related papers  (2021-04-05T18:00:46Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Iterative Correction of Sensor Degradation and a Bayesian Multi-Sensor Data Fusion Method [0.0]
  We present a novel method for inferring ground-truth signal from degraded signals. The algorithm learns a multiplicative degradation effect by performing iterative corrections of two signals. We include theoretical analysis and prove convergence to the ground-truth signal for the noiseless measurement model.
  arXiv  Detail & Related papers  (2020-09-07T13:24:47Z)
• Offline detection of change-points in the mean for stationary graph signals [55.98760097296213]
  We propose an offline method that relies on the concept of graph signal stationarity. Our detector comes with a proof of a non-asymptotic inequality oracle.
  arXiv  Detail & Related papers  (2020-06-18T15:51:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.