MLFeb 20, 2016

The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM

arXiv:1602.06349v16 citations
Originality Incremental advance
AI Analysis

This addresses segmentation problems in time series analysis, offering a simpler and more efficient alternative to existing methods, though it appears incremental as it builds on prior hierarchical models.

The paper tackled the problem of time series segmentation by proposing the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model that outperforms conventional iHMMs and matches or exceeds the performance of more complex hierarchical HMMs.

We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conventional iHMMs often struggle with such problems, since they have no mechanism for distinguishing between high- and low-level dynamics. Hierarchical HMMs (HHMMs) can do better, but they require much more complex and expensive inference algorithms. The siHMM retains the simplicity and efficiency of the iHMM, but outperforms it on a variety of segmentation problems, achieving performance that matches or exceeds that of a more complicated HHMM.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes