Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions

DOI10.1016/J.PATCOG.2010.07.004MaRDI QIDQ609175zbMATHOpenAlexFDO

Authors Adilson Elias Xavier, Vinicius Layter Xavier

Publication date 30 November 2010

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.patcog.2010.07.004

zbMATH Keywords

cluster analysishyperbolic smoothingnondifferentiable programmingminimum sum-of-squares clusteringmin-sum-min problemsMSSC problem

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• The hyperbolic smoothing clustering method
• A scatter search approach for the minimum sum-of-squares clustering problem
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• Qualitative properties of the minimum sum-of-squares clustering problem
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• A tabu search approach for the minimum sum-of-squares clustering problem
• Minimum sum of squares clustering in a low dimensional space
• Review of basic local searches for solving the minimum sum-of-squares clustering problem

Cites work

• scientific article; zbMATH DE number 3678973 (Why is no real title available?)
• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• Cluster analysis and mathematical programming
• Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
• TSPLIB—A Traveling Salesman Problem Library
• The hyperbolic smoothing clustering method

Cited in

(15)

• Strategic oscillation for the balanced minimum sum-of-squares clustering problem
• The hyperbolic smoothing clustering method
• New diagonal bundle method for clustering problems in large data sets
• Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
• A heuristic algorithm for solving the minimum sum-of-squares clustering problems
• An incremental clustering algorithm based on hyperbolic smoothing
• On smooth relaxations of obstacle sets
• A hyperbolic smoothing approach to the multisource Weber problem
• New and efficient DCA based algorithms for minimum sum-of-squares clustering
• Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
• Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
• Solving the continuous multiple allocation \(p\)-hub median problem by the hyperbolic smoothing approach
• The use of the hyperbolic smoothing clustering algorithm in taxonomy of macroalgae
• Hyperbolic regression: a new regression model with applications to the binary classification problem
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering

Describes a project that uses

Uses Software

• TSPLIB
• UCI

This page was built for publication: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q609175)