The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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.</p>
Unsupervised data analysis, mixture models, Bayesian analysis, reversible-jump Markov Chain Monte Carlo, number of clusters.

S. J. Roberts, C. Holmes and D. Denison, "Minimum-Entropy Data Partitioning Using Reversible Jump Markov Chain Monte Carlo," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 23, no. , pp. 909-914, 2001.
81 ms
(Ver 3.3 (11022016))