AI Paper Atlas

Research map / Time series / Causal and generative time series

Consistent Algorithms for Clustering Time Series

Azadeh Khaleghi, Daniil Ryabko, Jérémie Mary, Philippe Preux

JMLR 2016 · Time series › Causal and generative time series · approach: Probabilistic and conformal forecasting · 41 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 Algorithm 1 instead of Li and Prakash methodMOCAP motion clustering · Walk vs. Run (#16)conditional entropy: 0.3786 -> 0.2109Improved
use Algorithm 1 instead of Jebara et al. on ergodic motionsMOCAP motion clustering · Walk(#7) vs. Run/Jog(#35)accuracy: 95% -> 100%Improved
use Algorithm 1 instead of Jebara et al. on non-ergodic jumpsMOCAP motion clustering · Jump vs. Jump fwd.(#13) and (#13, 16)accuracy: 87% -> 100% and 66% -> 60%Mixed
use online algorithm instead of offline algorithm when new sequences arrive over timesynthetic rotation-process clustering · online settingclustering error rate: online error converges to zero while offline remains consistently highImproved
increase sequence length in batch settingonline and offline algorithms · synthetic rotation-process clusteringclustering error rate: error rate of each algorithm decreases with sequence lengthImproved

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