咨询与建议

看过本文的还看了

相关文献

该作者的其他文献

文献详情 >The hyperbolic smoothing clust... 收藏

The hyperbolic smoothing clustering method

聚类方法的夸张变光滑

作     者:Xavier, Adilson Elias 

作者机构:Univ Fed Rio de Janeiro COPPE Grad Sch Engn Dept Syst Engn & Comp Sci BR-21945 Rio De Janeiro Brazil 

出 版 物:《PATTERN RECOGNITION》 (图形识别)

年 卷 期:2010年第43卷第3期

页      面:731-737页

核心收录:

学科分类:0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)] 

主  题:Cluster analysis Min-sum-min problems Nondifferentiable programming Smoothing 

摘      要: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.

读者评论 与其他读者分享你的观点

用户名:未登录
我的评分