Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
From MaRDI portal
Publication:609175
DOI10.1016/j.patcog.2010.07.004zbMath1207.68326OpenAlexW2028073789MaRDI QIDQ609175
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
cluster analysishyperbolic smoothingnondifferentiable programmingminimum sum-of-squares clusteringmin-sum-min problemsMSSC problem
Related Items (12)
Solving the continuous multiple allocationp-hub median problem by the hyperbolic smoothing approach ⋮ The use of the hyperbolic smoothing clustering algorithm in taxonomy of macroalgae ⋮ Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions ⋮ Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems ⋮ Hyperbolic regression: a new regression model with applications to the binary classification problem ⋮ New and efficient DCA based algorithms for minimum sum-of-squares clustering ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ Strategic oscillation for the balanced minimum sum-of-squares clustering problem ⋮ On smooth relaxations of obstacle sets ⋮ A heuristic algorithm for solving the minimum sum-of-squares clustering problems ⋮ A hyperbolic smoothing approach to the multisource Weber problem ⋮ An incremental clustering algorithm based on hyperbolic smoothing
Uses Software
Cites Work
This page was built for publication: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions
