pith. sign in

arxiv: 2012.09608 · v2 · pith:LKAXABR3new · submitted 2020-12-14 · 💻 cs.LG · cs.AI

Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection

classification 💻 cs.LG cs.AI
keywords selectionalgorithmclassifiercshcdynamicproblemcaseclustering
0
0 comments X
read the original abstract

We consider the dynamic classifier selection (DCS) problem: Given an ensemble of classifiers, we are to choose which classifier to use depending on the particular input vector that we get to classify. The problem is a special case of the general algorithm selection problem where we have multiple different algorithms we can employ to process a given input. We investigate if a method developed for general algorithm selection named cost-sensitive hierarchical clustering (CSHC) is suited for DCS. We introduce some additions to the original CSHC method for the special case of choosing a classification algorithm and evaluate their impact on performance. We then compare with a number of state-of-the-art dynamic classifier selection methods. Our experimental results show that our modified CSHC algorithm compares favorably

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.