Skip to main navigation Skip to search Skip to main content

Quantized Kernel Learning Filter with Maximum Mixture Correntropy Criterion

  • Lin Chu*
  • , Wenling Li
  • *Corresponding author for this work
  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of 2019 Chinese Intelligent Automation Conference
EditorsZhidong Deng
PublisherSpringer Verlag
Pages647-655
Number of pages9
ISBN (Print)9789813290495
DOIs
StatePublished - 2020
EventChinese Intelligent Automation Conference, CIAC 2019 - Jiangsu, China
Duration: 20 Sep 201922 Sep 2019

Publication series

NameLecture Notes in Electrical Engineering
Volume586
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

ConferenceChinese Intelligent Automation Conference, CIAC 2019
Country/TerritoryChina
CityJiangsu
Period20/09/1922/09/19

Keywords

  • Kernel learning
  • Mixture correntropy
  • Quantized method

Fingerprint

Dive into the research topics of 'Quantized Kernel Learning Filter with Maximum Mixture Correntropy Criterion'. Together they form a unique fingerprint.

Cite this