Minimum message length grouping of ordered data

DOI10.1007/3-540-40992-0_5MaRDI QIDQ4473231zbMATH OpenFDO

Authors L. J. Fitzgibbon, Lloyd Allison, David L. Dowe

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1968/19680056.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• The kindest cut: Minimum message length segmentation
• Change-point estimation using new minimum message length approximations
• Statistical and inductive inference by minimum message length.
• Density estimation \textit {via} optimal segmentation
• Time-series segmentation: A model and a method

Cited in

(3)

• A global algorithm to estimate the expectations of the components of an observed univariate mixture
• The kindest cut: Minimum message length segmentation
• Change-point estimation using new minimum message length approximations

This page was built for publication: Minimum message length grouping of ordered data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473231)