Modeling high dimensional point clouds with the spherical cluster model
Fr\'ed\'eric Cazals, Antoine Commaret, Louis Goldenberg

TL;DR
This paper introduces the spherical cluster model (SC) for high-dimensional point clouds, providing a convex optimization approach and demonstrating its efficiency and median-like behavior in diverse datasets.
Contribution
The paper presents an exact solver for the SC model, analyzes its optimization properties, and evaluates its performance on high-dimensional data, advancing geometric clustering methods.
Findings
Exact solver outperforms heuristics in small to medium dimensions.
SC center acts as a high-dimensional median.
Efficient in high dimensions regardless of parameter ta.
Abstract
A parametric cluster model is a statistical model providing geometric insights onto the points defining a cluster. The {\em spherical cluster model} (SC) approximates a finite point set by a sphere as follows. Taking as a fraction (hyper-parameter) of the std deviation of distances between the center and the data points, the cost of the SC model is the sum over all data points lying outside the sphere of their power distance with respect to . The center of the SC model is the point minimizing this cost. Note that yields the celebrated center of mass used in KMeans clustering. We make three contributions. First, we show fitting a spherical cluster yields a strictly convex but not smooth combinatorial optimization problem. Second, we present an exact solver using the Clarke gradient on a suitable stratified cell…
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.
Taxonomy
TopicsAdvanced Clustering Algorithms Research · Point processes and geometric inequalities · Bayesian Methods and Mixture Models
