Bayesian Optimization With Tree Ensembles to Improve Depression Screening on Textual Datasets

IF 9.8 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Affective Computing Pub Date : 2024-08-13 DOI:10.1109/TAFFC.2024.3442557
Tingting Zhao;ML Tlachac
{"title":"Bayesian Optimization With Tree Ensembles to Improve Depression Screening on Textual Datasets","authors":"Tingting Zhao;ML Tlachac","doi":"10.1109/TAFFC.2024.3442557","DOIUrl":null,"url":null,"abstract":"Improving digital depression screening is important for combating the global mental health crisis. Textual data are promising for depression screening due to their many origins, but the variety presents screening challenges. To improve depression screening with textual data, we propose eXtreme Gradient Boosting (XGBoost) with Bayesian Optimization (BO). We experiment with three different objective functions to optimize our models. We apply our models to screen for depression with three disparate textual datasets containing features extracted from transcripts, SMS text messages, and typed replies. When compared to seven other machine learning methods, our XGBoost with BO models demonstrated impressive generalizability across the datasets, achieving average balanced accuracy scores of 0.60, 0.67, and 0.69 with transcripts, SMS text messages, and typed replies, respectively. Our feature importance assessment revealed that the most important features for these three text types were respectively negative emotion, youth, and love lexical category frequencies. Overall, our research presents a promising depression screening method that offers generalizability across text types, explainability, and computational efficiency.","PeriodicalId":13131,"journal":{"name":"IEEE Transactions on Affective Computing","volume":"16 2","pages":"573-585"},"PeriodicalIF":9.8000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Affective Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10634776/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Improving digital depression screening is important for combating the global mental health crisis. Textual data are promising for depression screening due to their many origins, but the variety presents screening challenges. To improve depression screening with textual data, we propose eXtreme Gradient Boosting (XGBoost) with Bayesian Optimization (BO). We experiment with three different objective functions to optimize our models. We apply our models to screen for depression with three disparate textual datasets containing features extracted from transcripts, SMS text messages, and typed replies. When compared to seven other machine learning methods, our XGBoost with BO models demonstrated impressive generalizability across the datasets, achieving average balanced accuracy scores of 0.60, 0.67, and 0.69 with transcripts, SMS text messages, and typed replies, respectively. Our feature importance assessment revealed that the most important features for these three text types were respectively negative emotion, youth, and love lexical category frequencies. Overall, our research presents a promising depression screening method that offers generalizability across text types, explainability, and computational efficiency.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用树集合进行贝叶斯优化,改进文本数据集的抑郁症筛查
改善数字抑郁症筛查对于应对全球精神卫生危机非常重要。文本数据是有希望的抑郁症筛查,由于他们的许多来源,但多样性提出了筛选的挑战。为了改进文本数据的抑郁筛选,我们提出了基于贝叶斯优化(BO)的极限梯度增强(XGBoost)方法。我们尝试了三种不同的目标函数来优化我们的模型。我们用三个不同的文本数据集来筛选抑郁症,这些数据集包含从抄本、短信和打字回复中提取的特征。与其他7种机器学习方法相比,我们的带有BO模型的XGBoost在数据集上表现出了令人印象深刻的泛化性,在转录本、短信和打字回复上分别实现了0.60、0.67和0.69的平均平衡准确率得分。我们的特征重要性评估显示,这三种文本类型最重要的特征分别是消极情绪、青春和爱情词汇类别频率。总的来说,我们的研究提出了一种很有前途的抑郁症筛查方法,它提供了跨文本类型的通用性,可解释性和计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Affective Computing
IEEE Transactions on Affective Computing COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-COMPUTER SCIENCE, CYBERNETICS
CiteScore
15.00
自引率
6.20%
发文量
174
期刊介绍: The IEEE Transactions on Affective Computing is an international and interdisciplinary journal. Its primary goal is to share research findings on the development of systems capable of recognizing, interpreting, and simulating human emotions and related affective phenomena. The journal publishes original research on the underlying principles and theories that explain how and why affective factors shape human-technology interactions. It also focuses on how techniques for sensing and simulating affect can enhance our understanding of human emotions and processes. Additionally, the journal explores the design, implementation, and evaluation of systems that prioritize the consideration of affect in their usability. We also welcome surveys of existing work that provide new perspectives on the historical and future directions of this field.
期刊最新文献
Video-Based Cross-Domain Emotion Recognition Via Sample-Graph Relations Self-Distillation EchoReason: a Two-stage Clinically Aligned Vision-Language Framework for Interpretable Diseases Diagnosis from Multi-Modal Ultrasound Advancing Micro-Expression Recognition: a Task-Specific Framework Integrating Frequency Analysis and Structural Embedding Facial Expression Recognition for Chinese Elderly Using Edge and Semantic Features Dual Path Network With Two-Step Transfer Learning An EEG-Based Multi-Source Domain Knowledge Transfer Framework for Cross-Session and Cross-Subject Emotion Recognition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1