Kernel matching reduction algorithms for classification

Jianwu Li*, Xiaocheng Deng

*Corresponding author for this work

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

Abstract

Inspired by kernel matching pursuit (KMP) and support vector machines (SVMs), we propose a novel classification algorithm: kernel matching reduction algorithm (KMRA). This method selects all training examples to construct a kernel-based functions dictionary. Then redundant functions are removed iteratively from the dictionary, according to their weights magnitudes, which are determined by linear support vector machines (SVMs). During the reduction process, the parameters of the functions in the dictionary can be adjusted dynamically. Similarities and differences between KMRA and several other machine learning algorithms are also addressed. Experimental results show KMRA can have sparser solutions than SVMs, and can still obtain comparable classification accuracies to SVMs.

Original languageEnglish
Title of host publicationRough Sets and Knowledge Technology - Third International Conference, RSKT 2008, Proceedings
Pages564-571
Number of pages8
DOIs
Publication statusPublished - 2008
Event3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008 - Chengdu, China
Duration: 17 May 200819 May 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5009 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Rough Sets and Knowledge Technology, RSKT 2008
Country/TerritoryChina
CityChengdu
Period17/05/0819/05/08

Keywords

  • Kernel matching pursuit
  • Kernel matching reduction algorithms
  • Radial basis function neural networks
  • Support vector machines

Fingerprint

Dive into the research topics of 'Kernel matching reduction algorithms for classification'. Together they form a unique fingerprint.

Cite this