In many real-life problems, obtaining labelled data can be a very expensive and laborious task, while unlabeled data can be abundant. The availability of labeled data can seriously limit the performance of supervised learning methods. Here, we propose a semi-supervised classification tree induction algorithm that can exploit both the labelled and unlabeled data, while preserving all of the appealing characteristics of standard supervised decision trees: being non-parametric, efficient, having good predictive performance and producing readily interpretable models. Moreover, we further improve their predictive performance by using them as base predictive models in random forests. We performed an extensive empirical evaluation on 12 binary and 12 multi-class classification datasets. The results showed that the proposed methods improve the predictive performance of their supervised counterparts. Moreover, we show that, in cases with limited availability of labeled data, the semi-supervised decision trees often yield models that are smaller and easier to interpret than supervised decision trees.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||Semi-supervised classification trees|
|Data di pubblicazione:||2017|
|Citazione:||Semi-supervised classification trees / Levatić, Jurica; Ceci, Michelangelo; Kocev, Dragi; Džeroski, Sašo. - In: JOURNAL OF INTELLIGENT INFORMATION SYSTEMS. - ISSN 0925-9902. - (2017), pp. 1-26.|
|Appare nelle tipologie:||1.1 Articolo in rivista|