Skip to main navigation Skip to search Skip to main content

Exploring margin for dynamic ensemble selection

  • School of Computer Science and Technology, Harbin Institute of Technology

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

Abstract

How to effectively combine the outputs of base classifiers is one of the key issues in ensemble learning. A new dynamic ensemble selection algorithm is proposed in this paper. In order to predict a sample, the base classifiers whose classification confidences on this sample are greater than or equal to specified threshold value are selected. Since margin is an important factor to the generalization performance of voting classifiers, thus the threshold value is estimated via the minimization of margin loss. We analyze the proposed algorithm in detail and compare it with some other multiple classifiers fusion algorithms. The experimental results validate the effectiveness of our algorithm.

Original languageEnglish
Title of host publicationRough Sets and Knowledge Technology - 8th International Conference, RSKT 2013, Proceedings
Pages178-187
Number of pages10
DOIs
StatePublished - 2013
Externally publishedYes
Event8th International Conference on Rough Sets and Knowledge Technology, RSKT 2013 - Halifax, NS, Canada
Duration: 11 Oct 201314 Oct 2013

Publication series

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

Conference

Conference8th International Conference on Rough Sets and Knowledge Technology, RSKT 2013
Country/TerritoryCanada
CityHalifax, NS
Period11/10/1314/10/13

Keywords

  • classification confidence
  • dynamic ensemble selection
  • margin
  • threshold value

Fingerprint

Dive into the research topics of 'Exploring margin for dynamic ensemble selection'. Together they form a unique fingerprint.

Cite this