Fast estimation of the Integrated Completed Likelihood criterion for change-point detection problems with applications to Next-Generation Sequencing data

Abstract : In this paper, we consider the Integrated Completed Likelihood (ICL) as a useful criterion for estimating the number of changes in the underlying distribution of data, specifically in problems where detecting the precise location of these changes is the main goal. The exact computation of the ICL requires O(Kn(2)) operations (with K the number of segments and n the number of data-points) which is prohibitive in many practical situations with large sequences of data. We describe a framework to estimate the ICL with O(K(2)n) complexity. Our approach is general in the sense that it can accommodate any given model distribution. We checked the run-time and validity of our approach on simulated data and demonstrate its good performance when analyzing real Next-Generation Sequencing (NGS) data using a negative binomial model. Our method is implemented in the R package postCP and available on the CRAN repository.
Type de document :
Article dans une revue
Signal Processing, Elsevier, 2014, 98, pp.233-242. 〈10.1016/j.sigpro.2013.11.029〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01197622
Contributeur : Archive Ouverte Prodinra <>
Soumis le : vendredi 11 septembre 2015 - 20:10:12
Dernière modification le : jeudi 31 mai 2018 - 09:12:02

Lien texte intégral

Identifiants

Citation

Alice Cleynen, The Minh Luong, Guillem Rigaill, Gregory Nuel. Fast estimation of the Integrated Completed Likelihood criterion for change-point detection problems with applications to Next-Generation Sequencing data. Signal Processing, Elsevier, 2014, 98, pp.233-242. 〈10.1016/j.sigpro.2013.11.029〉. 〈hal-01197622〉

Partager

Métriques

Consultations de la notice

227