arrow
Return

Handling imbalanced datasets through Optimum-Path Forest

delete2022-04-01
delete14
delete
OA
AI
L
Leandro A. Passos
D
Danilo Samuel Jodas *
L
Luiz Carlos Felix Ribeiro
J
João Paulo Papa
DOI:10.1016/j.knosys.2022.108445delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In the last decade, machine learning-based approaches became capable of performing a wide range of complex tasks sometimes better than humans, demanding a fraction of the time. Such an advance is partially due to the exponential growth in the amount of data available, which makes it possible to extract trustworthy real-world information from them. However, such data is generally imbalanced since some phenomena are more likely than others. Such a behavior yields considerable influence on the machine learning model's performance since it becomes biased on the more frequent data it receives. Despite the considerable amount of machine learning methods, a graph-based approach has attracted considerable notoriety due to the outstanding performance over many applications, i.e., the Optimum-Path Forest (OPF). In this paper, we propose three OPF-based strategies to deal with the imbalance problem: the (OPF)-P-2 and the OPF-US, which are novel approaches for oversampling and undersampling, respectively, as well as a hybrid strategy combining both approaches. The paper also introduces a set of variants concerning the strategies mentioned above. Results compared against several state-of-the-art techniques over public and private datasets confirm the robustness of the proposed approaches.& nbsp; (C)& nbsp;2022 Elsevier B.V. All rights reserved.
Keywords:
Imbalanced data
Oversampling
Undersampling
Optimum-Path Forest
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.2W
Citations:
4.5W

Organization

U
Universidade Estadual Paulista
Scholars:
3.2W
Papers: 2.1W
Citations: 24