Cargando…
Embedding Undersampling Rotation Forest for Imbalanced Problem
Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Hindawi
2018
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6236578/ https://www.ncbi.nlm.nih.gov/pubmed/30515200 http://dx.doi.org/10.1155/2018/6798042 |
_version_ | 1783371056754458624 |
---|---|
author | Guo, Huaping Diao, Xiaoyu Liu, Hongbing |
author_facet | Guo, Huaping Diao, Xiaoyu Liu, Hongbing |
author_sort | Guo, Huaping |
collection | PubMed |
description | Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which are characterized as having much less examples of one class (minority class) than the other (majority class), and the cost of misclassifying minority class examples is often much more expensive than the contrary cases. This paper proposes a novel method called Embedding Undersampling Rotation Forest (EURF) to handle this problem (1) sampling subsets from the majority class and learning a projection matrix from each subset and (2) obtaining training sets by projecting re-undersampling subsets of the original data set to new spaces defined by the matrices and constructing an individual classifier from each training set. For the first method, undersampling is to force the rotation matrix to better capture the features of the minority class without harming the diversity between individual classifiers. With respect to the second method, the undersampling technique aims to improve the performance of individual classifiers on the minority class. The experimental results show that EURF achieves significantly better performance comparing to other state-of-the-art methods. |
format | Online Article Text |
id | pubmed-6236578 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2018 |
publisher | Hindawi |
record_format | MEDLINE/PubMed |
spelling | pubmed-62365782018-12-04 Embedding Undersampling Rotation Forest for Imbalanced Problem Guo, Huaping Diao, Xiaoyu Liu, Hongbing Comput Intell Neurosci Research Article Rotation Forest is an ensemble learning approach achieving better performance comparing to Bagging and Boosting through building accurate and diverse classifiers using rotated feature space. However, like other conventional classifiers, Rotation Forest does not work well on the imbalanced data which are characterized as having much less examples of one class (minority class) than the other (majority class), and the cost of misclassifying minority class examples is often much more expensive than the contrary cases. This paper proposes a novel method called Embedding Undersampling Rotation Forest (EURF) to handle this problem (1) sampling subsets from the majority class and learning a projection matrix from each subset and (2) obtaining training sets by projecting re-undersampling subsets of the original data set to new spaces defined by the matrices and constructing an individual classifier from each training set. For the first method, undersampling is to force the rotation matrix to better capture the features of the minority class without harming the diversity between individual classifiers. With respect to the second method, the undersampling technique aims to improve the performance of individual classifiers on the minority class. The experimental results show that EURF achieves significantly better performance comparing to other state-of-the-art methods. Hindawi 2018-11-01 /pmc/articles/PMC6236578/ /pubmed/30515200 http://dx.doi.org/10.1155/2018/6798042 Text en Copyright © 2018 Huaping Guo et al. http://creativecommons.org/licenses/by/4.0/ This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Article Guo, Huaping Diao, Xiaoyu Liu, Hongbing Embedding Undersampling Rotation Forest for Imbalanced Problem |
title | Embedding Undersampling Rotation Forest for Imbalanced Problem |
title_full | Embedding Undersampling Rotation Forest for Imbalanced Problem |
title_fullStr | Embedding Undersampling Rotation Forest for Imbalanced Problem |
title_full_unstemmed | Embedding Undersampling Rotation Forest for Imbalanced Problem |
title_short | Embedding Undersampling Rotation Forest for Imbalanced Problem |
title_sort | embedding undersampling rotation forest for imbalanced problem |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6236578/ https://www.ncbi.nlm.nih.gov/pubmed/30515200 http://dx.doi.org/10.1155/2018/6798042 |
work_keys_str_mv | AT guohuaping embeddingundersamplingrotationforestforimbalancedproblem AT diaoxiaoyu embeddingundersamplingrotationforestforimbalancedproblem AT liuhongbing embeddingundersamplingrotationforestforimbalancedproblem |