An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
From MaRDI portal
Recommendations
- Minimum sum of squares clustering in a low dimensional space
- An improved column generation algorithm for minimum sum-of-squares clustering
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- The hyperbolic smoothing clustering method
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
Cited in
(50)- Variable neighbourhood search: Methods and applications
- Minimum sum of squares clustering in a low dimensional space
- New diagonal bundle method for clustering problems in large data sets
- Fuzzy J-means: a new heuristic for fuzzy clustering
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- K-means clustering via a nonconvex optimization approach
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections
- A distance-based point-reassignment heuristic for the k-hyperplane clustering problem
- Taxicab correspondence analysis
- A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
- An incremental clustering algorithm based on hyperbolic smoothing
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Optimising sum-of-squares measures for clustering multisets defined over a metric space
- A scatter search approach for the minimum sum-of-squares clustering problem
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- The hyperbolic smoothing clustering method
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Sequential clustering with radius and split criteria
- Column generation bounds for numerical microaggregation
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Qualitative properties of the minimum sum-of-squares clustering problem
- scientific article; zbMATH DE number 7416587 (Why is no real title available?)
- An algorithm for minimizing clustering functions
- Variable neighborhood search: Principles and applications
- An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
- Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
- Partitional clustering via successive transportation problems
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering
- Variable neighborhood search for harmonic means clustering
- A Computational Study of the DC Minimization Global Optimality Conditions Applied to K-Means Clustering
- Mixed integer linear programming formulation for K-means clustering problem
- A review on declarative approaches for constrained clustering
- Constrained clustering: current and new trends
- An improved column generation algorithm for minimum sum-of-squares clustering
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- A bisection method for solving distance-based clustering problems globally
- A cutting plane algorithm for globally solving low-dimensional k-means problems
- Strong bounds for large-scale minimum sum-of-squares clustering
- New and efficient DCA based algorithms for minimum sum-of-squares clustering
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- Optimal partitioning of a data set based on the \(p\)-median model
- Design of hybrids for the minimum sum-of-squares clustering problem
- Variable neighbourhood search: methods and applications
This page was built for publication: An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509784)
