.png){kind=icon}
返回
Sparse online feature maps
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2018.03.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Online kernel methods suffer from computational and memory complexity in large-scale problems. Due to these drawbacks, budget online kernel learning and kernel approximation (low-dimensional feature map approximation) methods are widely used to speed up time and to reduce memory usage of kernel approaches. In this paper, orthogonal Gram-Schmidt explicit feature maps are applied to online kernel methods. The main advantage of these feature maps come from their orthogonality property. Utilization of these feature maps leads to mutually linearly independent dimensions of feature space, hence, reduce the redundancy in this space. These feature maps can be applied to single-pass online learning methods with l(2)- and l(0)-norm regularization to reduce the computational and memory complexity. In this paper, the proposed methods are named: 1) Online Feature Maps (OFEMs) and 2) Sparse Online Feature Maps (SOFEMs). These methods are examined for binary and multiclass single-label classification problems. Extensive experiments are compared with the results of other state-of-the-art methods on standard and real-world datasets. The experimental results show that OFEMs and SOFEMs outperform other methods in the literature. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Explicit feature map
Kernel methods
Single-pass online learning
Gram-Schmidt orthogonalization process
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
Searching for exotic particles in high-energy physics with deep learning用深度学习寻找高能物理中的奇异粒子.png)
NATURE COMMUNICATIONS
NATURE COMMUNICATIONSIF15.7
PREAI
分享收藏
Gradient-based learning applied to document recognition基于梯度的学习在文档识别中的应用PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏
查看更多内容