arrow
返回

Why Is Multiclass Classification Hard?

delete2022-01-01
delete18
delete
OA
AI
P
Pablo del Moral *
S
Sławomir Nowaczyk
S
Sepideh Pashami
DOI:10.1109/ACCESS.2022.3192514delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In classification problems, as the number of classes increases, correctly classifying a new instance into one of them is assumed to be more challenging than making the same decision in the presence of fewer classes. The essence of the problem is that using the learning algorithm on each decision boundary individually is better than using the same learning algorithm on several of them simultaneously. However, why and when it happens is still not well-understood today. This work's main contribution is to introduce the concept of heterogeneity of decision boundaries as an explanation of this phenomenon. Based on the definition of heterogeneity of decision boundaries, we analyze and explain the differences in the performance of state of the art approaches to solve multi-class classification. We demonstrate that as the heterogeneity increases, the performances of all approaches, except one-vs-one, decrease. We show that by correctly encoding the knowledge of the heterogeneity of decision boundaries in a decomposition of the multi-class problem, we can obtain better results than state of the art decompositions. The benefits can be an increase in classification performance or a decrease in the time it takes to train and evaluate the models. We first provide intuitions and illustrate the effects of the heterogeneity of decision boundaries using synthetic datasets and a simplistic classifier. Then, we demonstrate how a real dataset exhibits these same principles, also under realistic learning algorithms. In this setting, we devise a method to quantify the heterogeneity of different decision boundaries, and use it to decompose the multi-class problem. The results show significant improvements over state-of-the-art decompositions that do not take the heterogeneity of decision boundaries into account.
Keyword:
Complexity theory
Classification algorithms
Task analysis
Support vector machines
Decision making
Ethics
Classification complexity
heterogeneity of decision boundaries
multi-class classification

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

H
Halmstad University
学者数:
948
论文数: 930
被引数: 995
引用论文

引用论文

Pitfalls of assessing extracted hierarchies for multi-class classification
err2023-04-01
err3
errOAAI
errdel Moral, Pablo; Nowaczyk, Slawomir; Sant'Anna, Anita; Pashami, Sepideh
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
A novel aluminosilicate geopolymer material with low dielectric loss
err2011-10-01
err0
PREAI
errXue-min Cui; Le-ping Liu; Yan He; Jin-yu Chen; Ji Zhou
err分享
err收藏
An overview of ensemble methods for binary classifiers in multi-class problems: Experimental study on one-vs-one and one-vs-all schemes
err2011-08-01
err592
PREAI
errGalar, Mikel; Fernandez, Alberto; Barrenechea, Edurne; Bustince, Humberto; Herrera, Francisco
err分享
err收藏
学者 查看更多内容