.png){kind=icon}
返回
Linear programming minimum sphere set covering for extreme learning machines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2007.07.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A novel optimum extreme learning machines (ELM) construction method was proposed. We define an extended covering matrix with smooth function, relax the objective and constraints to formulate a more general linear programming method for the minimum sphere set covering problem. We call this method linear programming minimum sphere set covering (LPMSSC). We also present a corresponding kernelized LPMSSC and extended LPMSSC with non-Euclidean L1 and L-infinity metric. We then propose to apply the LPMSSC method to ELM and propose a data dependent ELM (DDELM) algorithm. We can obtain compact ELM for pattern classification via LPMSSC. We investigate the performances of the proposed method through UCI benchmark data sets. (c) 2007 Elsevier B.V. All rights reserved.
Keyword:
extreme learning machines
minimum sphere set covering
linear programming
pattern classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
分享收藏Effect of homopolymer in polymerization-induced microphase separation process均聚物在聚合诱导微相分离过程中的作用.png)
Polymer
OAAI
PolymerIF0
OAAI分享收藏Enhanced adsorption of Cu(ii) ions on chitosan microspheres functionalized with polyethylenimine-conjugated poly(glycidyl methacrylate) brushesRSC Advances
RSC AdvancesIF0
PREAI
分享收藏分享收藏 没有更多内容
没有更多内容