Norm statistics and the complexity of clustering problems
From MaRDI portal
Recommendations
- Size constrained distance clustering: separation properties and some complexity results
- scientific article; zbMATH DE number 2081029
- On complexity of some problems of cluster analysis of vector sequences
- NP-hardness of some max-min clustering problems
- NP-hardness of some quadratic Euclidean 2-clustering problems
Cites work
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A projection method for \(l_ p\) norm location-allocation problems
- Cluster Analysis and Mathematical Programming
- Integer Programming and the Theory of Grouping
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- On Grouping for Maximum Homogeneity
- Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Variable neighborhood search
Cited in
(6)- Optimal stratification and clustering on the line using the \(L_ 1\)- norm
- Exact algorithms for size constrained 2-clustering in the plane
- Statistical properties of convex clustering
- On the complexity of redescription mining
- Size constrained distance clustering: separation properties and some complexity results
- New perspectives on \(k\)-support and cluster norms
This page was built for publication: Norm statistics and the complexity of clustering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1026145)
