.png){kind=icon}
返回
The hyperbolic smoothing clustering method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2009.06.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Cluster analysis
Min-sum-min problems
Nondifferentiable programming
Smoothing
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
J-MEANS: a new local search heuristic for minimum sum of squares clustering.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏
分享收藏分享收藏
查看更多内容