A stacking ensemble learning approach for scientific data classification

Procedia Computer Science Pub Date : 2026-01-01 Epub Date: 2026-09-18 DOI:10.1016/j.procs.2026.08.048
Jianjun Yu, Shaowei Qin, Jingheng Zhang, Fangyu Liao, Jun Hao
{"title":"A stacking ensemble learning approach for scientific data classification","authors":"Jianjun Yu,&nbsp;Shaowei Qin,&nbsp;Jingheng Zhang,&nbsp;Fangyu Liao,&nbsp;Jun Hao","doi":"10.1016/j.procs.2026.08.048","DOIUrl":null,"url":null,"abstract":"<div><div>To address the limitations of individual models in adaptive performance and the challenges of utilizing high-dimensional, sparse text features in automated scientific data classification, this paper proposes an approach based on an improved Stacking ensemble learning framework. Using dataset names and keywords as inputs, the method constructs lightweight text features via TF-IDF, bypassing the need for complex feature engineering. The experimental evaluation was conducted on a real-world scientific dataset comprising 4,505 samples across five disciplines. The performance of the proposed stacking model was benchmarked against four individual models and two simple ensemble methods (soft voting and weighted average). The results indicate that SVC exhibits the best adaptability to high-dimensional, sparse short-text features. Furthermore, ensemble models consistently outperformed individual models. Notably, the effectiveness of the stacking ensemble is determined by the quality and complementarity of the base models rather than their quantity. The proposed Stacking model achieved the highest classification performance, reaching an accuracy of 0.9024 on the test set. This lightweight, efficient, and stable method provides robust technical support for the automated classification and hierarchical governance of scientific data.</div></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"287 ","pages":"Pages 276-281"},"PeriodicalIF":0.0000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Procedia Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877050926026839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/9/18 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To address the limitations of individual models in adaptive performance and the challenges of utilizing high-dimensional, sparse text features in automated scientific data classification, this paper proposes an approach based on an improved Stacking ensemble learning framework. Using dataset names and keywords as inputs, the method constructs lightweight text features via TF-IDF, bypassing the need for complex feature engineering. The experimental evaluation was conducted on a real-world scientific dataset comprising 4,505 samples across five disciplines. The performance of the proposed stacking model was benchmarked against four individual models and two simple ensemble methods (soft voting and weighted average). The results indicate that SVC exhibits the best adaptability to high-dimensional, sparse short-text features. Furthermore, ensemble models consistently outperformed individual models. Notably, the effectiveness of the stacking ensemble is determined by the quality and complementarity of the base models rather than their quantity. The proposed Stacking model achieved the highest classification performance, reaching an accuracy of 0.9024 on the test set. This lightweight, efficient, and stable method provides robust technical support for the automated classification and hierarchical governance of scientific data.
科学数据分类的堆叠集成学习方法
为了解决单个模型在自适应性能方面的局限性以及在自动科学数据分类中利用高维稀疏文本特征所面临的挑战,本文提出了一种基于改进的堆叠集成学习框架的方法。该方法使用数据集名称和关键字作为输入,通过TF-IDF构建轻量级文本特征,绕过了复杂特征工程的需要。实验评估是在一个现实世界的科学数据集上进行的,该数据集包括五个学科的4,505个样本。用四种单独的模型和两种简单的集成方法(软投票和加权平均)对所提出的叠加模型的性能进行了基准测试。结果表明,SVC对高维、稀疏的短文本特征具有最好的适应性。此外,集成模型始终优于单个模型。值得注意的是,叠加集成的有效性取决于基本模型的质量和互补性,而不是它们的数量。本文提出的叠加模型的分类性能最高,在测试集上达到了0.9024的准确率。这种轻量级、高效和稳定的方法为科学数据的自动分类和分层治理提供了强大的技术支持。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.50
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书