.png){kind=icon}
.png){kind=icon}
Return
Fixed budget quantized kernel least-mean-square algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2013.02.012.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a quantized kernel least mean square algorithm with a fixed memory budget, named QKLMS-FB. In order to deal with the growing support inherent in online kernel methods, the proposed algorithm utilizes a pruning criterion, called significance measure, based on a weighted contribution of the existing data centers. The basic idea of the proposed methodology is to discard the center with the smallest influence on the whole system, when a new sample is included in the dictionary. The significance measure can be updated recursively at each step which is suitable for online operation. Furthermore, the proposed methodology does not need any a priori knowledge about the data and its computational complexity is linear with the center number. Experiments show that the proposed algorithm successfully prunes the least significant centers and preserves the important ones, resulting in a compact KLMS model with little loss in accuracy. (c) 2013 Elsevier B.V. All rights reserved.
Keywords:
Kernel methods
Quantized kernel least mean square
Fixed budget
Growing and pruning
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W
