The Kindest Cut: Minimum Message Length Segmentation

No abstract is available for this paper.

• Publication year

  1996

• Venue

  International Conference on Algorithmic Learning Theory

• Publication date

  1996-10-23

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-61863-5_36
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Classification and Regression Trees

  2000cited by this paper
• Improved Use of Continuous Attributes in C4.5

  1996cited by this paper
• Unsupervised Learning Using MML

  1996cited by this paper
• Minimum description length based 2D shape description

  1993cited by this paper
• Parameter estimation of finite mixtures using the EM algorithm and information criteria with application to medical image processing

  1992cited by this paper
• Sphere Packings, Lattices and Groups

  1990cited by this paper
• Estimation and Inference by Compact Coding

  1987influential reference

• The Trick of the Tail: Segmenting Heavy-Tailed Distributions

  2024cites this paper
• Message from Monte Carlo : a framework for minimum message length inference using Markov Chain Monte Carlo methods

  2021cites this paper
• Mining human mobility patterns from pervasive spatial and temporal data

  2018cites this paper
• Information gain-based metric for recognizing transitions in human activities

  2017cites this paper
• MML Is Not Consistent for Neyman-Scott

  2016cites this paper
• Estimating the predominant number of clusters in a dataset

  2013cites this paper
• Stability Selection of the Number of Clusters

  2011cites this paper
• Model selection using Minimal Message Length: an example using pollen data

  2010cites this paper
• Enhancing the Effectiveness of Clustering with Spectra Analysis

  2007cites this paper
• Segmentation and clustering as complementary sources of information

  2007cites this paper
• Learning States and Rules for Detecting Anomalies in Time Series

  2005cites this paper
• On gradients and response curves

  2005cites this paper
• A Spectroscopy of Texts for Effective Clustering

  2004cites this paper
• Learning states for detecting anomalies in time series

  2004cites this paper
• Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms

  2004cites this paper
• Change-Point Estimation Using New Minimum Message Length Approximations

  2002cites this paper
• Minimum Message Length Grouping of Ordered Data

  2000influential citation
• Minimum Message Length Segmentation

  1998cites this paper
• Bayesian in principle, but not always in practice

  1997cites this paper
• Bayesian Approaches to Segmenting A Simple Time Series

  1997influential citation