SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:DiVA.org:hh-48116"
 

Sökning: id:"swepub:oai:DiVA.org:hh-48116" > Why Is Multiclass C...

Why Is Multiclass Classification Hard?

Del Moral, Pablo, 1989- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
Nowaczyk, Sławomir, 1978- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
Pashami, Sepideh, 1985- (författare)
Högskolan i Halmstad,Akademin för informationsteknologi
 (creator_code:org_t)
Piscataway, NJ : IEEE, 2022
2022
Engelska.
Ingår i: IEEE Access. - Piscataway, NJ : IEEE. - 2169-3536. ; 10, s. 80448-80462
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • 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. © 2013 IEEE.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Nyckelord

Classification complexity
heterogeneity of decision boundaries
multi-class classification

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Del Moral, Pablo ...
Nowaczyk, Sławom ...
Pashami, Sepideh ...
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Data och informa ...
Artiklar i publikationen
IEEE Access
Av lärosätet
Högskolan i Halmstad

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy