scientific article; zbMATH DE number 7255118

zbMATH Open1502.92008MaRDI QIDQ4969147FDOQ4969147

Toby Hocking, Guillem Rigaill, Guillaume Bourque, Paul Fearnhead

Publication date: 5 October 2020

Full work available at URL: https://jmlr.csail.mit.edu/papers/v21/18-843.html

Title of this publication is not available (Why is that?)

zbMATH Keywords

changepointoptimizationsegmentationnon-convexconstrained

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Dynamic programming in optimal control and differential games (49L20)

Cites Work

• On optimal multiple changepoint algorithms for large data
• Detecting multiple change-points in the mean of Gaussian process by model selection
• Estimating the number of change-points via Schwarz' criterion
• Algorithms for the optimal identification of segment neighborhoods
• Optimal Detection of Changepoints With a Linear Computational Cost
• Segmentation of the Poisson and negative binomial rate models: a penalized estimator
• A Modified Bayes Information Criterion with Applications to the Analysis of Comparative Genomic Hybridization Data
• A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
• The Reduced Monotonic Regression Method

Cited In (5)

• Detecting Changes in Slope With an L₀ Penalty
• Exact Spike Train Inference Via $\ell_0$ Optimization
• PeakSegOptimal
• Detecting Abrupt Changes in the Presence of Local Fluctuations and Autocorrelated Noise
• Labeled Optimal Partitioning

Uses Software

• R
• CRAN
• isotone
• coseg
• gfpop
• PeakSeg
• PeakSegDisk

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969147)