| Full text | |
| Author(s): |
Nakano, Felipe Kenji
;
Mastelini, Saulo Martiello
;
Barbon, Sylvio, Jr.
;
Cerri, Ricardo
;
Chen, X
;
Luo, B
;
Luo, F
;
Palade, V
;
Wani, MA
Total Authors: 9
|
| Document type: | Journal article |
| Source: | 2017 16TH IEEE INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS (ICMLA); v. N/A, p. 8-pg., 2017-01-01. |
| Abstract | |
Hierarchical Classification (HC) consists of classification problems whose classes are structured in a hierarchical fashion. Many problems are addressed by HC, in special a decent amount of works dealt with bioinformatics related problems such as Protein Function Prediction (PFP) and Transposable Elements (TEs) classification. Both of them are still a challenging task for HC due to the noisy and imbalanced nature of the datasets. As a countermeasure, Stacking is an ensemble method capable of generalizing knowledge from many classifiers. In this work, we propose three Stacking methods for HC and evaluate its performance on PFP and TEs datasets. Our results show that, when compared to regular Stacking and state-of-art methods from the literature, our methods are able to obtain superior or competitive performances. (AU) | |
| FAPESP's process: | 15/14300-1 - Hierarchical classification of transposable elements using machine learning |
| Grantee: | Ricardo Cerri |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 16/12489-2 - Deep learning for hierarchical classification of transposable elements |
| Grantee: | Felipe Kenji Nakano |
| Support Opportunities: | Scholarships in Brazil - Master |