返回
An information theoretic sparse kernel algorithm for online learning
DOI:10.1016/j.eswa.2014.01.010.png)
摘要
En 中文
Kernel-based algorithms have been proven successful in many nonlinear modeling applications. However, the computational complexity of classical kernel-based methods grows superlinearly with the increasing number of training data, which is too expensive for online applications. In order to solve this problem, the paper presents an information theoretic method to train a sparse version of kernel learning algorithm. A concept named instantaneous mutual information is investigated to measure the system reliability of the estimated output. This measure is used as a criterion to determine the novelty of the training sample and informative ones are selected to form a compact dictionary to represent the whole data. Furthermore, we propose a robust learning scheme for the training of the kernel learning algorithm with an adaptive learning rate. This ensures the convergence of the learning algorithm and makes it converge to the steady state faster. We illustrate the performance of our proposed algorithm and compare it with some recent kernel algorithms by several experiments. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Kernel methods
Information theoretic
Sparsification
Online learning
Mutual information
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
ISOLATION OF AMYLOID P COMPONENT (PROTEIN AP) FROM NORMAL SERUM AS A CALCIUM-DEPENDENT BINDING PROTEIN
The Lancet
IF0
LASSO-TYPE RECOVERY OF SPARSE REPRESENTATIONS FOR HIGH-DIMENSIONAL DATA高维数据稀疏表示的LASSO型恢复
ANNALS OF STATISTICS
IF3.7
Online chaotic time series prediction using unbiased composite kernel machine via Cholesky factorization
SOFT COMPUTING
IF2.5
A multi-class SVM classification system based on learning methods from indistinguishable chinese official documents基于无差别中文公文学习方法的多类SVM分类系统

