A Cascaded Ensemble Framework Using BERT and Graph Features for Emotion Detection From English Poetry

Researchers have developed complex deep-learning models to extract emotions from poetry, opting for these over lightweight models. However, this approach requires a high volume of resources, which can be a significant limitation. Moreover, they often suffer from overfitting, making them less effective in real-time scenarios. This work introduces a novel cascaded ensemble framework that combines the strengths of BERT and Graph features (CP Net). The framework is designed in a tiered approach, classifying the majority of emotions in poetry, thereby reducing the need to invoke more complex models later on. This strategic arrangement enables efficient resource allocation and minimizes the usage of complex models. The basic model may not classify all so that a later model will classify residual unclassified emotions in the poetry. While the basic models in the first phase classify the majority of emotions in poetry, the remaining unclassified emotions are then passed on to the subsequent stages of the model, where more complex models can further process and classify them. This work performs feature fusion only in case of failed input samples. The performance of the proposed model is evaluated and compared against four baseline models using word embedding models, including Glove and Fast Text. The proposed CP Net model demonstrated exceptional performance, surpassing all other models by achieving an impressive 95% accuracy on the CAPEMO dataset and an outstanding 98% accuracy on the BAPEMO dataset. CP Net achieved state-of-the-art results with a minimum computational time of 0.274 to 0.332 milliseconds, outperforming other models.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3555897
Primary Topic
Sentiment Analysis and Opinion Mining
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Cascaded Ensemble Framework Using BERT and Graph Features for Emotion Detection From English Poetry

Venkata Krishna Kishore Kolli, Venkatrama Phani Kumar Sistla, Praveen K. Kazipeta
IEEE Access
Sentiment Analysis and Opinion Mining
article

A Cascaded Ensemble Framework Using BERT and Graph Features for Emotion Detection From English Poetry

Venkata Krishna Kishore Kolli, Venkatrama Phani Kumar Sistla, Praveen K. Kazipeta
article en

Abstract

Researchers have developed complex deep-learning models to extract emotions from poetry, opting for these over lightweight models. However, this approach requires a high volume of resources, which can be a significant limitation. Moreover, they often suffer from overfitting, making them less effective in real-time scenarios. This work introduces a novel cascaded ensemble framework that combines the strengths of BERT and Graph features (CP Net). The framework is designed in a tiered approach, classifying the majority of emotions in poetry, thereby reducing the need to invoke more complex models later on. This strategic arrangement enables efficient resource allocation and minimizes the usage of complex models. The basic model may not classify all so that a later model will classify residual unclassified emotions in the poetry. While the basic models in the first phase classify the majority of emotions in poetry, the remaining unclassified emotions are then passed on to the subsequent stages of the model, where more complex models can further process and classify them. This work performs feature fusion only in case of failed input samples. The performance of the proposed model is evaluated and compared against four baseline models using word embedding models, including Glove and Fast Text. The proposed CP Net model demonstrated exceptional performance, surpassing all other models by achieving an impressive 95% accuracy on the CAPEMO dataset and an outstanding 98% accuracy on the BAPEMO dataset. CP Net achieved state-of-the-art results with a minimum computational time of 0.274 to 0.332 milliseconds, outperforming other models.

IEEE AccessVol. 13
Vignan's Foundation for Science, Technology & Research (IN)
Openalex Percentile: Top 97%
Sentiment Analysis and Opinion Mining
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.