On optimal segmentation of sequential data

@inproceedings{Kohlmorgen2003OnOS,
  title={On optimal segmentation of sequential data},
  author={Jens Kohlmorgen},
  booktitle={NNSP},
  year={2003}
}
We present an algorithm that efficiently computes optimal partitions of sequential data into 1 to N segments and propose a method to determine the most salient segmentation among them. As a by-product, we obtain a regularization parameter that can be used to compute such salient segmentations – also on new data sets – even more efficiently. 

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…