Active learning Rotation Forest for multiclass classification. (6th May 2019)

• Record Type: Journal Article
• Authors: Kazllarof, Vangjel; Karlos, Stamatis; Kotsiantis, Sotiris
• Is Part Of: Computational intelligence. Volume 35:Number 4(2019)
• Page Start: 891
• Page End: 918
• Publication Date: 2019-05-06
• Subjects: active learning -- labeled/unlabeled data -- margin/random sampling query -- pool‐based scenario -- Rotation Forest; Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12217
• Languages: English
• ISSNs: 0824-7935

Abstract

Abstract: Although the achievements of the computer science field have facilitated the tasks of collecting, storing, and accessing vast amounts of data efficiently, its annotation still remains a non–easily resolvable problem since no automated mechanism can perform reliably enough. This fact is even more profound when the objective is the high quality of generalization ability. Active learning constitutes a scheme that is exploited for tackling such problems, controlling the demanded human effort under a trade‐off assumption concerning the achievement of higher accuracy rates. In this work, the well‐known Rotation Forest algorithm is integrated with the active learning theory for constructing a robust and accurate classifier. Thus, apart from exploiting the collected labeled data, unlabeled data mining takes place through appropriate queries, whereas human expert decisions over the most questionable of them enrich the initial ones. Comprehensive comparisons of the proposed algorithm against four distinct learners inside the same learning scheme were executed. Moreover, the baseline strategy of random sampling and the corresponding supervised scenarios were included. During the evaluation stage, 13 publicly available multiclass datasets were assessed, and the obtained results verified our assumptions, regarding also the significant supremacy of the proposed algorithm against the majority of its rivals.