paper-with-me

Papers

Cost-sensitive Boosting Pruning Trees for depression detection on Twitter

2019-06-02 · Lei Tong, Zhihua Liu, Zheheng Jiang, Feixiang Zhou, Long Chen, Jialin Lyu, Xiangrong Zhang, Qianni Zhang, Abdul Sadka Senior, Yinhai Wang, Ling Li, Huiyu Zhou

Depression is one of the most common mental health disorders, and a large number of depressed people commit suicide each year. Potential depression sufferers usually do not consult psychological doctors because they feel ashamed or are unaware of any depression, which may result in severe delay of diagnosis and treatment. In the meantime, evidence shows that social media data provides valuable clues about physical and mental health conditions. In this paper, we argue that it is feasible to identify depression at an early stage by mining online social behaviours. Our approach, which is innovative to the practice of depression detection, does not rely on the extraction of numerous or complicated features to achieve accurate depression detection. Instead, we propose a novel classifier, namely, Cost-sensitive Boosting Pruning Trees (CBPT), which demonstrates a strong classification ability on two publicly accessible Twitter depression detection datasets. To comprehensively evaluate the classification capability of the CBPT, we use additional three datasets from the UCI machine learning repository and the CBPT obtains appealing classification results against several state of the arts boosting algorithms. Finally, we comprehensively explore the influence factors of model prediction, and the results manifest that our proposed framework is promising for identifying Twitter users with depression.

📄 PDF Abstract BibTeX arXiv:1906.00398

Code (1)

BIPL-UoL/Cost-Boosting-Pruning-Trees-for-depression-detection-on-Twitter 공식 구현

Tasks

Depression DetectionGeneral Classification

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Improved Multi-Class Cost-Sensitive Boosting via Estimation of the Minimum-Risk Class

2016-07-12 · Ron Appel, Xavier Burgos-Artizzu, Pietro Perona

We present a simple unified framework for multi-class cost-sensitive boosting. The minimum-risk class is estimated directly, rather than via an approximation of the posterior distribution. Our method jointly optimizes bi…

Optimally Pruning Decision Tree Ensembles With Feature Cost

2016-01-05 · Feng Nan, Joseph Wang, Venkatesh Saligrama

We consider the problem of learning decision rules for prediction with feature budget constraint. In particular, we are interested in pruning an ensemble of decision trees to reduce expected feature cost while maintainin…

Ensemble PruningPrediction

Accelerated Gradient Boosting

2018-03-06 · Gérard Biau, Benoît Cadre, Laurent Rouvìère

Gradient tree boosting is a prediction algorithm that sequentially produces a model in the form of linear combinations of decision trees, by solving an infinite-dimensional optimization problem. We combine gradient boost…

Fast Linear Model Trees by PILOT

2023-02-08 · Jakob Raymaekers, Peter J. Rousseeuw, Tim Verdonck, Ruicong Yao

Linear model trees are regression trees that incorporate linear models in the leaf nodes. This preserves the intuitive interpretation of decision trees and at the same time enables them to better capture linear relations…

modelModel Selectionregression

Online Local Boosting: improving performance in online decision trees

2019-07-16 · Victor G. Turrisi da Costa, Saulo Martiello Mastelini, André C. Ponce de Leon Ferreira de Carvalho, Sylvio Barbon Jr

As more data are produced each day, and faster, data stream mining is growing in importance, making clear the need for algorithms able to fast process these data. Data stream mining algorithms are meant to be solutions t…