Extreme Gradient Boosted Multi-label Trees for Dynamic Classifier Chains

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Classifier chains is a key technique in multi-label classification, since it allows to consider label dependencies effectively. However, the classifiers are aligned according to a static order of the labels. In the concept of dynamic classifier chains (DCC) the label ordering is chosen for each prediction dynamically depending on the respective instance at hand. We combine this concept with the boosting of extreme gradient boosted trees (XGBoost), an effective and scalable state-of-the-art technique, and incorporate DCC in a fast multi-label extension of XGBoost which we make publicly available. As only positive labels have to be predicted and these are usually only few, the training costs can be further substantially reduced. Moreover, as experiments on eleven datasets show, the length of the chain allows for more control over the usage of previous predictions and hence over the measure one wants to optimize.

Cite

CITATION STYLE

APA

Bohlender, S., Loza Mencía, E., & Kulessa, M. (2020). Extreme Gradient Boosted Multi-label Trees for Dynamic Classifier Chains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12323 LNAI, pp. 471–485). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61527-7_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free