On optimal segmentation of sequential data

2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718) Pub Date : 2003-09-17 DOI:10.1109/NNSP.2003.1318044

J. Kohlmorgen

引用次数: 9

Abstract

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.

查看原文本刊更多论文

序列数据的最优分割

我们提出了一种算法，可以有效地将序列数据划分为1到N个段，并提出了一种确定其中最显著分割的方法。作为副产品，我们获得了一个正则化参数，该参数可用于更有效地计算这种显著分割-也适用于新数据集-甚至更有效。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718)

自引率

0.00%

发文量