.png){kind=icon}
返回
Multi-distance support matrix machines
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2019.09.004.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Real-world data such as digital images, MRI scans and electroencephalography signals are naturally represented as matrices with structural information. Most existing classifiers aim to capture these structures by regularizing the regression matrix or introducing factorization technique. In this paper, we propose a multi-distance support matrix machine (MDSMM), which formulates the optimization problem by introducing the concept of multi-distance. Unlike traditional matrix-based classifiers, the proposed approach uses a vector-based distance to quantify the cost function and penalty function. We further study the generalization bounds for i.i.d. processes and non i.i.d. processes based on different classifiers. For typical hypothesis classes where matrix norms are constrained, MDSMM achieves a faster learning rate than conventional methods. We demonstrate the merits of the proposed approach by conducting comparative experiments on both simulation study and a number of real-world datasets. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Multi-distance support matrix machine
Generalization bounds
Rademacher complexity
Vapnik-Chervonenkis dimension
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
8.0K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏 没有更多内容
没有更多内容