Local Cluster Cardinality Estimation for Adaptive Mean Shift
By: Étienne Pepin
Potential Business Impact:
Finds groups of things even when they're different sizes.
This article presents an adaptive mean shift algorithm designed for datasets with varying local scale and cluster cardinality. Local distance distributions, from a point to all others, are used to estimate the cardinality of the local cluster by identifying a local minimum in the density of the distance distribution. Based on these cardinality estimates, local cluster parameters are then computed for the entire cluster in contrast to KDE-based methods, which provide insight only into localized regions of the cluster. During the mean shift execution, the cluster cardinality estimate is used to adaptively adjust the bandwidth and the mean shift kernel radius threshold. Our algorithm outperformed a recently proposed adaptive mean shift method on its original dataset and demonstrated competitive performance on a broader clustering benchmark.
Similar Papers
Stochastic Mean-Shift Clustering
Machine Learning (CS)
Groups similar sounds together automatically.
Almost Linear Time Consistent Mode Estimation and Quick Shift Clustering
Machine Learning (CS)
Finds patterns in huge amounts of information fast.
Hyperbolic Gaussian Blurring Mean Shift: A Statistical Mode-Seeking Framework for Clustering in Curved Spaces
Machine Learning (CS)
Finds hidden groups in complex, branching data.