On L 1 -Norm Multiclass Support Vector Machines
L1范数多分类支持向量机AI 解读 ↓
← 返回论文列表与筛选
阅读说明
本页整理公开书目信息，不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成，未完成全文核验，可能有误；具体假设、证明与结论请核对原文。摘要保留来源文本，未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要；缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录，不合计多个记录；关联记录可能包含正式发表版本，不等于此版本单独引用。缺失不视为零，引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配，同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列，再参考通用方法与发表日期。
分类依据与纠错
AI 根据所提供的论文材料归类：摘要研究通用高维分类及基因组学场景，分类预测不足以支持经济离散选择或金融收益预测的细分。
反馈分类问题
正在核对关联版本…
代码、数据与补充材料
正在核对对应版本的资源…
关注这篇论文的作者
L1范数多分类支持向量机
- 研究问题
- 当变量数量远大于训练样本量时，如何在多分类任务中同步进行分类和变量选择，并刻画稀疏学习的泛化误差？
- 方法与思路
- 作者通过L1惩罚的稀疏表示构造多分类支持向量机，开发正则化解路径，并以学习理论、模拟和基准数据评价方法。
- 材料陈述的贡献
- 摘要称方法能够处理变量数远超样本量的选择问题，并给出泛化误差理论；数值比较提示其预测准确率具有竞争力。
- 阅读关注点
- 应核对多分类损失与稀疏表示、解路径算法、误差界的假设和维度限制，以及基准比较中的调参与验证方式。
- 阅读边界
- 仅据稿件版本未注明的OpenAlex索引摘要；刊本一致性、误差界和数值结果未提供，竞争力陈述不能推广到所有分类任务。
原文摘要
Binary support vector machines (SVMs) have been proven to deliver high performance. In multiclass classification, however, issues remain with respect to variable selection. One challenging issue is classification and variable selection in the presence of variables in the magnitude of thousands, greatly exceeding the size of training sample. This often occurs in genomics classification. To meet the challenge, this article proposes a novel multiclass support vector machine, which performs classification and variable selection simultaneously through an L1-norm penalized sparse representation. The proposed methodology, together with the developed regularization solution path, permits variable selection in such a situation. For the proposed methodology, a statistical learning theory is developed to quantify the generalization error in an attempt to gain insight into the basic structure of sparse learning, permitting the number of variables to greatly exceed the sample size. The operating characteristics of the methodology are examined through both simulated and benchmark data and are compared against some competitors in terms of accuracy of prediction. The numerical results suggest that the proposed methodology is highly competitive.