On a Nonconvex Distance-Based Clustering Problem
- 25 June 2022
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The planar -means problem is NP-hardTheoretical Computer Science, 2012
- On a continuous approach for the maximum weighted clique problemJournal of Global Optimization, 2012
- Multitask Bregman clusteringNeurocomputing, 2011
- Quantization and clustering with Bregman divergencesJournal of Multivariate Analysis, 2010
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2009
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Joint and Separate Convexity of the Bregman DistanceStudies in Computational Mathematics, 2001
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967