Dynamic classifier chains for multi-label learning
Not on the map. Why?
Abstract (arXiv)
In this paper, we deal with the task of building a dynamic ensemble of chain classifiers for multi-label classification. To do so, we proposed two concepts of classifier chains algorithms that are able to change label order of the chain without rebuilding the entire model. Such modes allows anticipating the instance-specific chain order without a significant increase in computational burden. The proposed chain models are built using the Naive Bayes classifier and nearest neighbour approach as a base single-label classifiers. To take the benefits of the proposed algorithms, we developed a simple heuristic that allows the system to find relatively good label order. The heuristic sort labels according to the label-specific classification quality gained during the validation phase. The heuristic tries to minimise the phenomenon of error propagation in the chain. The experimental results showed that the proposed model based on Naive Bayes classifier the above-mentioned heuristic is an efficient tool for building dynamic chain classifiers.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 1.
2 papers.
- 2021Tree-Based Dynamic Classifier Chainscited by 2
- 2023Minimal Learning Machine for Multi-Label Learningcited by 0
- 2023Minimal Learning Machine for Multi-Label Learning9 May 2023
- 2021Tree-Based Dynamic Classifier Chains13 Dec 2021