Machine Learning Based Stress Detection for IT Professionals Using Random Forest algorithm
Keywords:
Random forest, adaboost, extra treeAbstract
In today’s fast-paced tech world, managing stress is becoming more crucial, especially for those in IT. The work culture in this industry often means long hours, tight deadlines, and high expectations, which can ramp up stress levels. When stress goes unchecked, it not only takes a toll on professionals' health and well-being but also impacts their productivity and job satisfaction. This study aims to predict stress levels among IT professionals using machine learning techniques, helping to promote proactive stress management. We look at various indicators of work-related stress, such as Heart Rate, Skin Conductivity, Hours Worked, Number of Emails Sent, and Meetings Attended. These factors give us a well-rounded view of both the physical and work-related elements that contribute to stress. By applying machine learning in this area, we’re taking an innovative approach to a growing concern. With the power of data analytics, this model seeks to offer practical insights for both individuals and organizations. Individuals can use these predictions for self-monitoring and early intervention, while organizations can pinpoint high-stress roles or environments, allowing them to allocate resources or interventions more effectively.
Downloads
References
Bakker, Mykola Pechenizkiy, Natalia Sidorova , What’s your current stress level? Detection of stress patterns from GSR sensor data, 2011 11th IEEE International Conference on Data Mining Workshops,Department of Computer Science Eindhoven University of Technology, 978-0-7695-4409-0/11 $26.00 © 2011 IEEE DOI 10.1109/ICDMW.2011.17
J. Clerk Maxwell, A Treatise on Electricity and Magnetism, 3rd ed., vol. 2. Oxford: Clarendon, 1892, pp.68–73.
I. S. Jacobs and C. P. Bean, “Fine particles, thin films and exchange anisotropy,” in Magnetism, vol. III, G. T. Rado and H. Suhl, Eds. New York: Academic, 1963, pp. 271–350.
K. Elissa, “Title of paper if known,” unpublished.
R. Nicole, “Title of paper with only first word capitalized,” J. Name Stand. Abbrev., in press.
Y. Yorozu, M. Hirano, K. Oka, and Y. Tagawa, “Electron spectroscopy studies on magneto-optical media and plastic substrate interface,” IEEE Transl. J. Magn. Japan, vol. 2, pp. 740–741, August 1987 [Digests 9th Annual Conf. Magnetics Japan, p. 301, 1982].
M. Young, The Technical Writer’s Handbook. Mill Valley, CA: University Science, 1989.
G. Eason, B. Noble, and I. N. Sneddon, “On certain integrals of Lipschitz-Hankel type involving products of Bessel functions,” Phil. Trans. Roy. Soc. London, vol. A247, pp. 529–551, April 1955. (references).
UnsuKristina P. Sinaga and Miin-Shen Yang, pervised K-Means Clustering Algorithm , 2018 IEEE International Symposium on Smart Electronic Systems (iSES) (Formerly iNiS).
Jirong Gu, Jieming Zhou Xianwei Chen Xianwei Chen, An Enhancement of K-means Clustering Algorithm, 2009 International Conference on Business Intelligence and Financial Engineering.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 International Journal of Scientific Research in Computer Science, Engineering and Information Technology

This work is licensed under a Creative Commons Attribution 4.0 International License.