Minimum-Entropy Data Partitioning Using Reversible Jump Markov Chain Monte Carlo

  • Authors:
  • Stephen J. Roberts;Chris Holmes;Dave Denison

  • Affiliations:
  • Univ. of Oxford, Oxford, UK;Imperial College, London, UK;Imperial College, London, UK

  • Venue:
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Year:
  • 2001

Quantified Score

Hi-index 0.14

Visualization

Abstract

Problems in data analysis often require the unsupervised partitioning of a data set into classes. Several methods exist for such partitioning but many have the weakness of being formulated via strict parametric models (e.g., each class is modeled by a single Gaussian) or being computationally intensive in high-dimensional data spaces. We reconsider the notion of such cluster analysis in information-theoretic terms and show that an efficient partitioning may be given via a minimization of partition entropy. A reversible-jump sampling is introduced to explore the variable-dimension space of partition models.