.png){kind=icon}
Return
The hyperbolic smoothing clustering method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2009.06.018.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The minimum sum-of-squares clustering problem is considered. The mathematical modeling of this problem leads to a min-sum-min formulation which, in addition to its intrinsic bi-level nature, has the significant characteristic of being strongly nondifferentiable. To overcome these difficulties, the resolution, method proposed adopts a smoothing strategy using a special C-infinity differentiable class function. The final solution is obtained by solving a sequence of low dimension differentiable unconstrained optimization subproblems which gradually approach the original problem. The use of this technique, called hyperbolic smoothing, allows the main difficulties presented by the original problem to be overcome. A simplified algorithm containing only the essentials of the method is presented. For the purpose of illustrating both the reliability and the efficiency of the method, a set of computational experiments was performed, making use of traditional test problems described in the literature (C) 2009 Elsevier Ltd. All rights reserved.
Keywords:
Cluster analysis
Min-sum-min problems
Nondifferentiable programming
Smoothing
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available
Cited Papers
J-MEANS: a new local search heuristic for minimum sum of squares clustering.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
ShareSave
ShareSaveShareSave
View more