Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IDA
2007
Springer

favoriteEmaildiscussreport

118views Information Technology» more IDA 2007»

Voting experts: An unsupervised algorithm for segmenting sequences

13 years 4 months ago

Voting experts: An unsupervised algorithm for segmenting sequences

Download www.cs.arizona.edu

We describe a statistical signature of chunks and an algorithm for ﬁnding chunks. While there is no formal deﬁnition of chunks, they may be reliably identiﬁed as conﬁgurations with low internal entropy or unpredictability and high entropy at their boundaries. We show that the log frequency of a chunk is a measure of its internal entropy. The Voting-Experts exploits the signature of chunks to ﬁnd word boundaries in text from four languages and episode boundaries in the activities of a mobile robot.

Paul R. Cohen, Niall M. Adams, Brent Heeringa

Real-time Traffic

IDA 2007 | Information Technology | Internal Entropy | Low Internal Entropy | Statistical Signature |

claim paper

Related Content

» Hierarchical Voting Experts An Unsupervised Algorithm for Segmenting Hierarchically Struct...

» The Markov Expert for Finding Episodes in Time Series

» Joint Segmentation of Thalamic Nuclei from a Population of Diffusion Tensor MR Images

» Hierarchical Probabilistic Segmentation of Discrete Events

» Unsupervised Facade Segmentation Using Repetitive Patterns

» Unsupervised Word Decomposition with the Promodes Algorithm

» MostlyUnsupervised Statistical Segmentation of Japanese Kanji Sequences

» An Algorithm for Segmenting Categorical Time Series into Meaningful Episodes

» Probabilistic SpatialTemporal Segmentation of Multiple Sclerosis Lesions

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2007
Where	IDA
Authors	Paul R. Cohen, Niall M. Adams, Brent Heeringa

Comments (0)