.png){kind=icon}
返回
An efficient active set method for optimization extreme learning machines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2015.01.092.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper an efficient active set algorithm is presented for fast training of Optimization Extreme Learning Machines (OELMs). This algorithm suggests the use of an efficient identification technique of active set and the value reassignment technique for quadratic programming problem. With these strategies, this algorithm is able to drop many constraints from the active set at each iteration, and it can converge to the optimal solution with less iterations. The global convergence properties of the algorithm as well as its theoretical properties are analyzed. The effectiveness of the algorithm is demonstrated via benchmark datasets from many sources. Experiment results indicate that the quadratic programming problem which keeps the number of constraints in the active set as small as possible is computationally most efficient. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Optimization extreme learning machines
Quadratic programming
Active set
Piecewise projected gradient
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Flow Properties and Melt Distortion in Molten Rubber Compounds under Capillary Extrusion: Effects of Vulcanizing Systems and Fillers熔融橡胶复合材料在毛细管挤出中的流动特性和熔体畸变：硫化体系和填料的影响
PREAI
分享收藏 没有更多内容
没有更多内容