.png){kind=icon}
返回
An Improved Kernel Minimum Square Error Classification Algorithm Based on L2,1-Norm Regularization
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2730218.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The kernel minimum square error classification (KMSEC) algorithm has been widely used in classification problems. It shows a good performance on image data besides the following drawbacks: not sparse in the solutions and sensitive to noises. The latter drawback will result in a decrease in the recognition performance. To this end, we propose an improved (IKMSEC) by using the L-2,L-1-norm regularization, which can obtain a sparse representation of nonlinear features to guarantee an efficient classification performance. The comprehensive experiments show the promising results in face recognition and image classification.
Keyword:
Minimum square error classification
kernel
L-2,L-1-norm
pattern recognition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
On the Development and Applications of Cellulosic Nanofibrillar and Nanocrystalline Materials纤维素纳米原纤和纳米晶材料的发展与应用
PREAI
分享收藏The FERET database and evaluation procedure for face-recognition algorithms人脸识别算法的FERET数据库和评估程序
PREAI
分享收藏A sparse representation method of bimodal biometrics and palmprint recognition experiments.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容