.png){kind=icon}
.png){kind=icon}
Return
Stretchy binary classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2017.09.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Pattern classification
Parameter learning
Sparse estimation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.3
Papers:
7.8K
Citations:
3.0W
View more organizations