Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Interpretable clustering using unsupervised binary trees
The planar \(k\)-means problem is NP-hard
Guaranteed clustering and biclustering via semidefinite programming
An improved column generation algorithm for minimum sum-of-squares clustering
NP-hardness of Euclidean sum-of-squares clustering
Robust and online large-scale optimization. Models and techniques for transportation systems
Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
Adjustable robust solutions of uncertain linear programs
Robust K-Median and K-means clustering algorithms for incomplete data
Modelling over and undercounts for design-based Monte Carlo studies in small area estimation: an application to the German register-assisted census
The generalized equivalence of regularization and min-max robustification in linear mixed models
A decomposition heuristic for mixed-integer supply chain problems
Biconvex sets and optimization with biconvex functions: a survey and extensions
Lectures on Modern Convex Optimization
Theory and Applications of Robust Optimization
The Price of Robustness
Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
Clustering in General Measurement Error Models
Exact Clustering of Weighted Graphs via Semidefinite Programming
Least squares quantization in PCM
Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods
Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
Measurement Error in Nonlinear Models
Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
Robust support vector machines for classification and computational issues
Robust estimation of economic indicators from survey samples based on Pareto tail modelling

This page was built for publication: Robustification of the \(k\)-means clustering problem and tailored decomposition methods: when more conservative means more accurate