N-ary decomposition for multi-class classification

Joey Tianyi Zhou, Ivor W. Tsang, Shen Shyang Ho, Klaus Muller

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A common way of solving a multi-class classification problem is to decompose it into a collection of simpler two-class problems. One major disadvantage is that with such a binary decomposition scheme it may be difficult to represent subtle between-class differences in many-class classification problems due to limited choices of binary-value partitions. To overcome this challenge, we propose a new decomposition method called N-ary decomposition that decomposes the original multi-class problem into a set of simpler multi-class subproblems. We theoretically show that the proposed N-ary decomposition could be unified into the framework of error correcting output codes and give the generalization error bound of an N-ary decomposition for multi-class classification. Extensive experimental results demonstrate the state-of-the-art performance of our approach.

Original languageEnglish
Pages (from-to)809-830
Number of pages22
JournalMachine Learning
Volume108
Issue number5
DOIs
Publication statusPublished - 2019 May 15

Fingerprint

Decomposition

Keywords

  • Ensemble learning
  • Multi-class classification
  • N-ary ECOC

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this

Zhou, J. T., Tsang, I. W., Ho, S. S., & Muller, K. (2019). N-ary decomposition for multi-class classification. Machine Learning, 108(5), 809-830. https://doi.org/10.1007/s10994-019-05786-2

N-ary decomposition for multi-class classification. / Zhou, Joey Tianyi; Tsang, Ivor W.; Ho, Shen Shyang; Muller, Klaus.

In: Machine Learning, Vol. 108, No. 5, 15.05.2019, p. 809-830.

Research output: Contribution to journalArticle

Zhou, JT, Tsang, IW, Ho, SS & Muller, K 2019, 'N-ary decomposition for multi-class classification', Machine Learning, vol. 108, no. 5, pp. 809-830. https://doi.org/10.1007/s10994-019-05786-2
Zhou, Joey Tianyi ; Tsang, Ivor W. ; Ho, Shen Shyang ; Muller, Klaus. / N-ary decomposition for multi-class classification. In: Machine Learning. 2019 ; Vol. 108, No. 5. pp. 809-830.
@article{d38eb52922214712b23950c52862a486,
title = "N-ary decomposition for multi-class classification",
abstract = "A common way of solving a multi-class classification problem is to decompose it into a collection of simpler two-class problems. One major disadvantage is that with such a binary decomposition scheme it may be difficult to represent subtle between-class differences in many-class classification problems due to limited choices of binary-value partitions. To overcome this challenge, we propose a new decomposition method called N-ary decomposition that decomposes the original multi-class problem into a set of simpler multi-class subproblems. We theoretically show that the proposed N-ary decomposition could be unified into the framework of error correcting output codes and give the generalization error bound of an N-ary decomposition for multi-class classification. Extensive experimental results demonstrate the state-of-the-art performance of our approach.",
keywords = "Ensemble learning, Multi-class classification, N-ary ECOC",
author = "Zhou, {Joey Tianyi} and Tsang, {Ivor W.} and Ho, {Shen Shyang} and Klaus Muller",
year = "2019",
month = "5",
day = "15",
doi = "10.1007/s10994-019-05786-2",
language = "English",
volume = "108",
pages = "809--830",
journal = "Machine Learning",
issn = "0885-6125",
publisher = "Springer Netherlands",
number = "5",

}

TY - JOUR

T1 - N-ary decomposition for multi-class classification

AU - Zhou, Joey Tianyi

AU - Tsang, Ivor W.

AU - Ho, Shen Shyang

AU - Muller, Klaus

PY - 2019/5/15

Y1 - 2019/5/15

N2 - A common way of solving a multi-class classification problem is to decompose it into a collection of simpler two-class problems. One major disadvantage is that with such a binary decomposition scheme it may be difficult to represent subtle between-class differences in many-class classification problems due to limited choices of binary-value partitions. To overcome this challenge, we propose a new decomposition method called N-ary decomposition that decomposes the original multi-class problem into a set of simpler multi-class subproblems. We theoretically show that the proposed N-ary decomposition could be unified into the framework of error correcting output codes and give the generalization error bound of an N-ary decomposition for multi-class classification. Extensive experimental results demonstrate the state-of-the-art performance of our approach.

AB - A common way of solving a multi-class classification problem is to decompose it into a collection of simpler two-class problems. One major disadvantage is that with such a binary decomposition scheme it may be difficult to represent subtle between-class differences in many-class classification problems due to limited choices of binary-value partitions. To overcome this challenge, we propose a new decomposition method called N-ary decomposition that decomposes the original multi-class problem into a set of simpler multi-class subproblems. We theoretically show that the proposed N-ary decomposition could be unified into the framework of error correcting output codes and give the generalization error bound of an N-ary decomposition for multi-class classification. Extensive experimental results demonstrate the state-of-the-art performance of our approach.

KW - Ensemble learning

KW - Multi-class classification

KW - N-ary ECOC

UR - http://www.scopus.com/inward/record.url?scp=85066631663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066631663&partnerID=8YFLogxK

U2 - 10.1007/s10994-019-05786-2

DO - 10.1007/s10994-019-05786-2

M3 - Article

AN - SCOPUS:85066631663

VL - 108

SP - 809

EP - 830

JO - Machine Learning

JF - Machine Learning

SN - 0885-6125

IS - 5

ER -