Titre :

New efficient algorithms for multiple change-point detection with reproducing kernels

Auteur(s) :

Celisse, Alain [Auteur]
Université de Lille
32|||Laboratoire Paul Painlevé - UMR 8524 [LPP] (VALID)
Marot, Guillemette [Auteur]
Evaluation des technologies de santé et des pratiques médicales - ULR 2694 [METRICS]
METRICS : Evaluation des technologies de santé et des pratiques médicales - ULR 2694
Pierre-Jean, M. [Auteur]
Université d'Évry-Val-d'Essonne [UEVE]
Rigaill, G. J. [Auteur]
Université d'Évry-Val-d'Essonne [UEVE]

Titre de la revue :

Computational statistics & data analysis

Nom court de la revue :

Comput. Stat. Data Anal.

Numéro :

128

Pagination :

200-220

Éditeur :

Elsevier

Date de publication :

2018-12-01

ISSN :

0167-9473

Mot(s)-clé(s) en anglais :

Kernel method
Algorithms
Dynamic programming
DNA copy number
Allele B fraction
Gram matrix
Model selection
Nonparametric change-point detection

Discipline(s) HAL :

Sciences du Vivant [q-bio]

Résumé en anglais : [en]

Several statistical approaches based on reproducing kernels have been proposed to detect abrupt changes arising in the full distribution of the observations and not only in the mean or variance. Some of these approaches ...
Lire la suite >Several statistical approaches based on reproducing kernels have been proposed to detect abrupt changes arising in the full distribution of the observations and not only in the mean or variance. Some of these approaches enjoy good statistical properties (oracle inequality, consistency). Nonetheless, they have a high computational cost both in terms of time and memory. This makes their application difficult even for small and medium sample sizes (). This computational issue is addressed by first describing a new efficient procedure for kernel multiple change-point detection with an improved worst-case complexity that is quadratic in time and linear in space. It is based on an exact optimization algorithm and deals with medium size signals (up to ). Second, a faster procedure (based on an approximate optimization algorithm) is described. It relies on a low-rank approximation to the Gram matrix and is linear in time and space. The resulting procedure can be applied to large-scale signals (). These two procedures (based on the exact or approximate optimization algorithms) have been implemented in R and C for various kernels. The computational and statistical performances of these new algorithms have been assessed through empirical experiments. The runtime of the new algorithms is observed to be faster than that of other considered procedures. Finally, simulations confirmed the higher statistical accuracy of kernel-based approaches to detect changes that are not only in the mean. These simulations also illustrate the flexibility of kernel-based approaches to analyze complex biological profiles made of DNA copy number and allele B frequencies.Lire moins >

Langue :

Anglais

Audience :

Internationale

Vulgarisation :

Non

Établissement(s) :

CHU Lille
Université de Lille

Collections :

• METRICS : Evaluation des technologies de santé et des pratiques médicales - ULR 2694

Date de dépôt :

2019-12-09T18:18:58Z
2021-05-25T07:02:52Z
2024-03-06T10:20:16Z