Skip to main navigation Skip to search Skip to main content

Data dimension reduction using rough sets for support vector classifier

  • Genting Yan*
  • , Guangfu Ma
  • , Liangkuan Zhu
  • *Corresponding author for this work
  • Harbin Institute of Technology

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

Abstract

This paper proposes an application of rough sets as a data preprocessing front end for support vector classifier (SVC). A novel multi-class support vector classification strategy based on binary tree is also presented. The binary tree extends the pairwise discrimination capability of the SVC to the multi-class case naturally. Experimental results on benchmark datasets show that proposed method can reduce computation complexity without decreasing classification accuracy compare to SVC without data preprocessing.

Original languageEnglish
Title of host publicationRough Sets and Knowledge Technology - First International Conference, RSKT 2006, Proceedings
PublisherSpringer Verlag
Pages462-467
Number of pages6
ISBN (Print)3540362975, 9783540362975
DOIs
StatePublished - 2006
EventFirst International Conference on Rough Sets and Knowledge Technology, RSKT 2006 - Chongqing, China
Duration: 24 Jul 200626 Jul 2006

Publication series

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

Conference

ConferenceFirst International Conference on Rough Sets and Knowledge Technology, RSKT 2006
Country/TerritoryChina
CityChongqing
Period24/07/0626/07/06

Keywords

  • Dimension reduction
  • Rough sets
  • Support vector classifier

Fingerprint

Dive into the research topics of 'Data dimension reduction using rough sets for support vector classifier'. Together they form a unique fingerprint.

Cite this