atlas

Research map / Learning theory and algorithms / Clustering

Bayesian Model Selection for Change Point Detection and Clustering

ICML 2018 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the two-pass dynamic programming algorithm for joint change-point detection and clusteringpiecewise-constant simulated signal, N=2000 and S/N = 1 · Simulated signal (300 simulations)change points correctly detected / change points detected: 0.8528Helped
Apply the second dynamic programming pass to cluster segments found in the first passTwo-Pass Dynamic Programming Algorithm · Difficult simulated signal (N=500, d''_{m^*}= 13)false change points retainedHelped
Use the proposed algorithm at low signal-to-noise ratiospiecewise-constant simulated signal · Simulated signal with S/N=0.5signal reconstruction: S/N=0.5Helped
Reduce observations per segment by scaling the signal to N=500Two-Pass Dynamic Programming Algorithm · Difficult simulated signal (N=500, d''_{m^*}= 13)change-point location accuracy: N=500 and d''_{m^*}= 13Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy