Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
From MaRDI portal
Publication:2131141
Recommendations
- Constrained Clustering Using Column Generation
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Constrained clustering problems: new optimization algorithms
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
Cites work
- An Algorithm for Euclidean Sum of Squares Classification
- An algorithmic framework for convex mixed integer nonlinear programs
- An elementary proof of a theorem of Johnson and Lindenstrauss
- An improved column generation algorithm for minimum sum-of-squares clustering
- An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Branching and bounds tighteningtechniques for non-convex MINLP
- Cluster analysis and mathematical programming
- Clustering formulation using constraint optimization
- Constrained clustering by constraint programming
- Constrained Clustering Using Column Generation
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Dimensionality reduction for k-means clustering and low rank approximation
- Extensions of Lipschitz mappings into a Hilbert space
- Gaussian random projections for Euclidean membership problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3886512 (Why is no real title available?)
- scientific article; zbMATH DE number 3129892 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 2109363 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Local branching
- Mathematical programming: Turing completeness and applications to software analysis
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Numerical Experience with Lower Bounds for MIQP Branch-And-Bound
- Numerical linear algebra in the streaming model
- Oblivious dimension reduction for \(k\)-means: beyond subspaces and the Johnson-Lindenstrauss lemma
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Quantile regression for large-scale applications
- Random projections for linear programming
- Random projections for quadratic programs
- Random projections for quadratic programs over a Euclidean ball
- Randomized Sketches of Convex Programs With Sharp Guarantees
- Reformulations in Mathematical Programming: Definitions and Systematics
- Scikit-learn: machine learning in Python
- Solving mixed integer nonlinear programs by outer approximation
- Static analysis by abstract interpretation: a mathematical programming approach
- Streaming k-means on well-clusterable data
- The iterated exponential integers
- Undecidability and hardness in mixed-integer nonlinear programming
Cited in
(9)- Using assignment constraints to avoid empty clusters in k-means clustering
- Size matters: cardinality-constrained clustering and outlier detection via conic optimization
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Mixed integer linear programming formulation for K-means clustering problem
- Random projections for linear programming: an improved retrieval phase
- Random projections for semidefinite programming
- A bisection method for solving distance-based clustering problems globally
- Mathematical optimization modelling for group counterfactual explanations
- Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
This page was built for publication: Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2131141)
