Multi-label chaining with imprecise probabilities
From MaRDI portal
Publication:2146044
DOI10.1007/978-3-030-86772-0_30OpenAlexW3204812587MaRDI QIDQ2146044
Sebastien Destercke, Yonatan Carlos Carranza Alarcón
Publication date: 15 June 2022
Full work available at URL: https://arxiv.org/abs/2107.07443
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beam search algorithms for multilabel learning
- On label dependence and loss minimization in multi-label classification
- The multilabel naive credal classifier
- Multilabel classification via calibrated label ranking
- The naive credal classifier
- Imprecise probability trees: bridging two theories of imprecise probability
- Multilabel Prediction with Probability Sets: The Hamming Loss Case
- Introduction to Imprecise Probabilities
- The elements of statistical learning. Data mining, inference, and prediction
This page was built for publication: Multi-label chaining with imprecise probabilities