Mental Stress Detection using Machine Learning Approach

International Journal of Innovative Research in Science, Engineering and Technology 13 (1):194-200 (2024)
  Copy   BIBTEX

Abstract

Depression is a pervasive and serious mental health concern with far-reaching consequences for individuals. Early detection and intervention are crucial in mitigating its impact. This paper explores the application of machine learning, specifically the random forest algorithm, to analyze social media data for depression detection. Additionally, real-time data collected from students and parents are employed to predict suicidal ideation, making this research a multifaceted approach to addressing mental health issues. Using a random forest algorithm, this study achieved an 86.45% accuracy rate in classifying social media posts as indicative of depression. Furthermore, the research employed an XGBoost algorithm to categorize real-time data into five depression severity stages, achieving an accuracy rate of 83.87%. These results highlight the potential of machine learning in identifying individuals at risk of depression and suicidal ideation. The proposed system offers several advantages, including scalability for analyzing extensive social media datasets, cost-effectiveness, and the ability to provide real-time depression detection, enabling early intervention. Despite challenges associated with noisy and unreliable social media data, as well as the need for models adaptable to diverse populations and contexts, recent advancements in random forest algorithms have shown promise in improving depression detection accuracy. In the future, research in this area should focus on refining machine learning models for more robust and precise depression detection, exploring their applicability across various populations and settings, and developing supportive tools for individuals grappling with depression.

Analytics

Added to PP
2025-03-31

Downloads
40 (#107,139)

6 months
40 (#104,210)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?