Big Data Imbalance Classification using Nonlinear Grasshopper Optimization Algorithm and Long Short-Term Memory with Rectified Linear Unit

Imbalanced data is common in the real world, and its classification remains one of the most researched topics.Existing techniques often suffer from imbalanced data, leading to overfitting and reduced classification performance.Therefore, a Nonlinear Decreasing Coefficient-based Grasshopper Optimization Algorithm (NGOA) and Long Short-Term Memory with Rectified Linear Unit (LSTM with ReLU) are proposed for big data imbalance classification.The traditional GOA, combined with a nonlinear decreasing coefficient, provides an adaptive optimization approach that improves search efficiency and solution quality in complex problems.Min-max normalization ensures that features are scaled properly, accounting for sensitivity to feature magnitude, thereby enhancing convergence and performance.The Synthetic Minority Oversampling Technique (SMOTE) is applied to generate synthetic data points, increasing the number of instances in minority classes to match those of the majority class through data synthesis.Metrics such as accuracy, precision, recall, F1-score, and Area Under the Curve (AUC) are used to evaluate the performance of the NGOA-LSTM with ReLU.The NGOA-LSTM with ReLU achieves accuracies of 96.00%, 99.80%, and 99.20% for the Pima, Yeast, and Heart datasets, respectively, compared to boosting approaches.

Publication Details

Journal
International journal of intelligent engineering and systems
Published
2025-05-10
DOI
https://doi.org/10.22266/ijies2025.0630.08
Primary Topic
Imbalanced Data Classification Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Big Data Imbalance Classification using Nonlinear Grasshopper Optimization Algorithm and Long Short-Term Memory with Rectified Linear Unit

1 links
International journal of intelligent engineering and systems
Imbalanced Data Classification Techniques
article

Big Data Imbalance Classification using Nonlinear Grasshopper Optimization Algorithm and Long Short-Term Memory with Rectified Linear Unit

article en

Abstract

Imbalanced data is common in the real world, and its classification remains one of the most researched topics.Existing techniques often suffer from imbalanced data, leading to overfitting and reduced classification performance.Therefore, a Nonlinear Decreasing Coefficient-based Grasshopper Optimization Algorithm (NGOA) and Long Short-Term Memory with Rectified Linear Unit (LSTM with ReLU) are proposed for big data imbalance classification.The traditional GOA, combined with a nonlinear decreasing coefficient, provides an adaptive optimization approach that improves search efficiency and solution quality in complex problems.Min-max normalization ensures that features are scaled properly, accounting for sensitivity to feature magnitude, thereby enhancing convergence and performance.The Synthetic Minority Oversampling Technique (SMOTE) is applied to generate synthetic data points, increasing the number of instances in minority classes to match those of the majority class through data synthesis.Metrics such as accuracy, precision, recall, F1-score, and Area Under the Curve (AUC) are used to evaluate the performance of the NGOA-LSTM with ReLU.The NGOA-LSTM with ReLU achieves accuracies of 96.00%, 99.80%, and 99.20% for the Pima, Yeast, and Heart datasets, respectively, compared to boosting approaches.

International journal of intelligent engineering and systemsVol. 18(5)
Openalex Percentile: Top 95%
Imbalanced Data Classification Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.