A Preselection-Based Fast Support Vector Machine Learning for Large-Scale Pattern Sets using Compressed Relative Neighborhood Graph

Masanori Goto, Ryosuke Ishida, Seiichi Uchida

Research output: Contribution to journalArticlepeer-review

Abstract

We propose a pre-selection method for training support vector machines (SVM) with a largescale dataset. Specifically, the proposed method selects patterns around the class boundary and the selected data is fed to train an SVM. For the selection, that is, searching for boundary patterns, we utilize a compressed representation of relative neighborhood graph (Clustered-RNG). A Clustered-RNG is a network of neighboring patterns which have a different class label and thus, we can find boundary patterns between different classes. Through large-scale handwritten digit pattern recognition experiments, we show that the proposed pre-selection method accelerates SVM training process 10 times faster without degrading recognition accuracy.

Original languageEnglish
Pages (from-to)1-7
Number of pages7
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume22
Issue number1
Publication statusPublished - Jan 2017

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A Preselection-Based Fast Support Vector Machine Learning for Large-Scale Pattern Sets using Compressed Relative Neighborhood Graph'. Together they form a unique fingerprint.

Cite this