About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Pattern Recognition Letters
Paper
k-quantiles: L1 distance clustering under a sum constraint
Abstract
This paper considers centroid-based clustering under ℓ1 distance in which both data points and cluster centers are subject to a sum constraint on their components. A closed-form solution is derived for the cluster center optimization problem, enabling an interpretation as a sample quantile of the cluster. An adaptive sampling initialization step is also adopted to provide a guarantee on expected clustering cost as well as empirical improvements. Experiments on synthetic data indicate that the advantages of the proposed algorithms increase as clusters become more concentrated and as the dimension increases. An application to clustering employee job role profiles highlights the utility of ℓ1 distance in promoting sparse, interpretable cluster centers.