.png){kind=icon}
返回
Stretchy binary classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2017.09.015.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we introduce an analytic formulation for compressive binary classification. The formulation seeks to solve the least l(p)-norm of the parameter vector subject to a classification error constraint. An analytic and stretchable estimation is conjectured where the estimation can be viewed as an extension of the pseudoinverse with left and right constructions. Our variance analysis indicates that the estimation based on the left pseudoinverse is unbiased and the estimation based on the right pseudoinverse is biased. Sparseness can be obtained for the biased estimation under certain mild conditions. The proposed estimation is investigated numerically using both synthetic and real-world data. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Pattern classification
Parameter learning
Sparse estimation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
分享收藏分享收藏Training feedforward neural networks using multi-verse optimizer for binary classification problems.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏分享收藏
查看更多内容