Convergence Analysis of a New MaxMin-SOMO Algorithm
文献类型:期刊论文
作者 | Atlas Khan1,3; Yan-Peng Qu2 |
刊名 | International Journal of Automation and Computing
![]() |
出版日期 | 2019 |
卷号 | 16期号:4页码:534-542 |
关键词 | Optimization self organizing map (SOM) SOM-based optimization (SOMO) algorithm particle swarm optimization (PSO) genetic algorithms (GAs). |
ISSN号 | 1476-8186 |
DOI | 10.1007/s11633-016-0996-0 |
英文摘要 | The convergence analysis of MaxMin-SOMO algorithm is presented. The SOM-based optimization (SOMO) is an optimization algorithm based on the self-organizing map (SOM) in order to find a winner in the network. Generally, through a competitive learning process, the SOMO algorithm searches for the minimum of an objective function. The MaxMin-SOMO algorithm is the generalization of SOMO with two winners for simultaneously finding two winning neurons i.e., first winner stands for minimum and second one for maximum of the objective function. In this paper, the convergence analysis of the MaxMin-SOMO is presented. More specifically, we prove that the distance between neurons decreases at each iteration and finally converge to zero. The work is verified with the experimental results. |
源URL | [http://ir.ia.ac.cn/handle/173211/42355] ![]() |
专题 | 自动化研究所_学术期刊_International Journal of Automation and Computing |
作者单位 | 1.Department of Computing and Mathematics FFCLRP, University of Sao Paulo, Ribeirao Preto, Brazil 2.School of Information Science and Technology, Dalian Maritime University, Dalian 116026, China 3.Department of Applied Mathematics Dalian University of Technology, Dalian 116024, China |
推荐引用方式 GB/T 7714 | Atlas Khan,Yan-Peng Qu. Convergence Analysis of a New MaxMin-SOMO Algorithm[J]. International Journal of Automation and Computing,2019,16(4):534-542. |
APA | Atlas Khan,&Yan-Peng Qu.(2019).Convergence Analysis of a New MaxMin-SOMO Algorithm.International Journal of Automation and Computing,16(4),534-542. |
MLA | Atlas Khan,et al."Convergence Analysis of a New MaxMin-SOMO Algorithm".International Journal of Automation and Computing 16.4(2019):534-542. |
入库方式: OAI收割
来源:自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。