TY  - CONF
ID  - mk:DS-18-DCC-RDT
T1  - Dynamic Classifier Chain with Random Decision Trees
A1  - Kulessa, Moritz
A1  - Loza Mencía, Eneldo
TI  - Proceedings of the 21st International Conference of Discovery Science (DS-18)
T3  - Lecture Notes in Artificial Intelligence
Y1  - 2018
VL  - 11198
SP  - 33
EP  - 50
PB  - Springer-Verlag
CY  - Limassol, Cyprus
SN  - 978-3-030-01771-2
UR  - /publications/papers/DS18_DynamicClassifierChains_RDT.pdf
M2  - doi: 10.1007/978-3-030-01771-2
N2  - Classifier chains is an effective approach in order to exploit label dependencies in multi-label data. However, it has the disadvantages that the chain is chosen at total random or relies on a pre-specified ordering of the labels which is expensive to compute. Moreover, the same ordering is used for every test instance, ignoring the fact that different orderings might be best suited for different test instances. We propose a new approach based on random decision trees (RDT) which can choose the label ordering for each prediction dynamically depending on the respective test instance. RDT are not adapted to a specific learning task, but in contrast allow to define a prediction objective on the fly during test time, thus offering a perfect test bed for directly comparing different prediction schemes. Indeed, we show that dynamically selecting the next label improves over using a static ordering of the labels under an otherwise unchanged RDT model and experimental environment.
ER  -