Optimal Clustering under Uncertainty
Lori A. Dalton, Marco E. Benalc\'azar, and Edward R. Dougherty

TL;DR
This paper develops a probabilistic framework for optimal robust clustering under uncertainty, extending classical methods to incorporate randomness and improve performance in applications like granular imaging.
Contribution
It introduces a new robust clustering approach based on effective random point processes that handle uncertainty and derives an optimal clusterer within this framework.
Findings
Robust clusterers outperform traditional methods in synthetic Gaussian mixtures.
The framework successfully applies to granular imaging using granulometric moment theory.
Performance evaluations demonstrate improved accuracy under uncertainty.
Abstract
Classical clustering algorithms typically either lack an underlying probability framework to make them predictive or focus on parameter estimation rather than defining and minimizing a notion of error. Recent work addresses these issues by developing a probabilistic framework based on the theory of random labeled point processes and characterizing a Bayes clusterer that minimizes the number of misclustered points. The Bayes clusterer is analogous to the Bayes classifier. Whereas determining a Bayes classifier requires full knowledge of the feature-label distribution, deriving a Bayes clusterer requires full knowledge of the point process. When uncertain of the point process, one would like to find a robust clusterer that is optimal over the uncertainty, just as one may find optimal robust classifiers with uncertain feature-label distributions. Herein, we derive an optimal robust…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
