Quantized Kernel Learning Filter with Maximum Mixture Correntropy Criterion
Kernel recursive maximum mixture correntropy criterion(KRMMCC)algorithm takes the mixture of two Gaussian kernel functions as the core function,which further improves the performance of machine learning.However,when the number of training data is large,the KRMMCC algorithm will face a large amount of computation.In order to restrain the growth of the radial basis function structure,this paper proposes a novel method named quantized kernel recursive maximum mixture correntropy criterion(QKRMMCC).This method judges whether the data is quantized to the nearest node by quantization rule,so as to sparse the final network size.The simulation results show that the QKRMMCC algorithm presents the excellent performance.
Kernel learning Quantized method Mixture correntropy
Lin Chu Wenling Li
School of Automation Science and Electrical Engineering,Beihang University,Beijing 100191,China
国际会议
江苏镇江
英文
647-655
2019-09-20（万方平台首次上网日期，不代表论文的发表时间）