Powered by OpenAIRE graph
Found an issue? Give us feedback
ZENODOarrow_drop_down
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
ZENODO
Article . 2025
License: CC BY
Data sources: Datacite
versions View all 2 versions
addClaim

Analyzing Various Machine Learning Classifiers for the efficient Prediction of Student Mental Stress

Authors: Priyanka Gupta 1, Dr. Anil Pandit2;

Analyzing Various Machine Learning Classifiers for the efficient Prediction of Student Mental Stress

Abstract

A prevalent societal issue that affects people nowadays is mental stress. Stress is typically felt when one feels that the amountof pressure or demand is more than one's ability to handle it. A person's thoughts, actions, emotions, and interpersonalcommunication can all be impacted by mental health problems. The major issues that student faces now a days that willsuffer their mental health are Depression, Addiction, Anxiety, Eating Disorders, Substance Misuse and Suicidal Intent.Some Students also suffers from a Huge Academic Pressure. It might be from their own mind for gaining more & more intheir Academics or might be from Parental Pressure. Accurate analysis and prediction of stress patterns may be possiblewith the use of machine learning techniques and enabling prompt responses. With an emphasis on the function of machinelearning models, the influence of physiological and behavioral characteristics, this paper explores the important facets ofmental stress detection. The search was conducted on several databases (IEEE, Scopus, Elsevier, and Web of Science).Thetopmost objective of the paper is to analyze various algorithms that are used to predict the level of stress among an individual.This Review paper is based on the analysis of various approaches and finally gives the most appealing among all. RandomForest & Gradient Boosting are the best algorithm with topmost accuracy that has been used in various papers and alsohelps in accurately predicting the level of stress among the individual.

Keywords

K Nearest Neighbor, Random Forest, Nave Bayes, Regression, Decision Tree, Support vector machine, Gradient Boosting

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!