Abstract
AbstractClassifier chains are an effective technique for modeling label dependencies in multi-label classification. However, the method requires a fixed, static order of the labels. While in theory, any order is sufficient, in practice, this order has a substantial impact on the quality of the final prediction. Dynamic classifier chains denote the idea that for each instance to classify, the order in which the labels are predicted is dynamically chosen. The complexity of a naïve implementation of such an approach is prohibitive, because it would require to train a sequence of classifiers for every possible permutation of the labels. To tackle this problem efficiently, we propose a new approach based on random decision trees which can dynamically select the label ordering for each prediction. We show empirically that a dynamic selection of the next label improves over the use of a static ordering under an otherwise unchanged random decision tree model. In addition, we also demonstrate an alternative approach based on extreme gradient boosted trees, which allows for a more target-oriented training of dynamic classifier chains. Our results show that this variant outperforms random decision trees and other tree-based multi-label classification methods. More importantly, the dynamic selection strategy allows to considerably speed up training and prediction.
Funder
Deutsche Forschungsgemeinschaft
Johannes Kepler University Linz
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference51 articles.
1. Bogatinovski, J., Todorovski, L., Dzeroski, S., Kocev, D. (2021). Comprehensive comparative study of multi-label classification methods. CoRR https://arxiv.org/abs/2102.07113
2. Bohlender, S., Loza Mencía, E., Kulessa, M.(2020). Extreme gradient boosted multi-label trees for dynamic classifier chains. In: Appice, A., Tsoumakas, G., Manolopoulos, Y., Matwin, S. (eds.) Proceedings of the 23rd International Conference of Discovery Science (DS-20). pp. 471–485. Springer, Thessaloniki, Greece , https://doi.org/10.1007/978-3-030-61527-7_31
3. Boutell, M.R., Luo, J., Shen, X., Brown, C.M.C.M. (2004). Learning multi-label scene classification. Pattern Recognition 37(9), 1757–1771 , http://www.rose-hulman.edu/~boutell/publications/boutell04PRmultilabel.pdf
4. Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5–32.
5. Chen, T., Guestrin, C .(2016). XGBoost: A scalable tree boosting system. In: Proc. of the 22nd SIGKDD Int. Conf. on Knowledge Discovery and Data Mining. pp. 785–794. ACM
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献