Unsupervised stress detection algorithm and experiments with real life data

14Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Stress is the major problem in the modern society and a reason for at least half of lost working days in European enterprises, but existing stress detectors are not sufficiently convenient for everyday use. One reason is that stress perception and stress manifestation vary a lot between individuals; hence, “one-fits-all-persons” stress detectors usually achieve notably lower accuracies than person-specific methods. The majority of existing approaches to person-specific stress recognition, however, employ fully supervised training, requiring to collect fairly large sets of labelled data from each end user. These sets should contain examples of stresses and normal conditions, and such data collection effort may be tiring for end users. Therefore this work proposes an algorithm to train person-specific stress detectors using only unlabelled data, not necessarily containing examples of stresses. The proposed method, based on Hidden Markov Models with maximum posterior marginal decision rule, was tested using real life data of 28 persons and achieved average stress detection accuracy of 75%, which is similar to the accuracies of state-of-the-art supervised algorithms for real life data.

Cite

CITATION STYLE

APA

Vildjiounaite, E., Kallio, J., Mäntyjärvi, J., Kyllönen, V., Lindholm, M., & Gimel’farb, G. (2017). Unsupervised stress detection algorithm and experiments with real life data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10423 LNAI, pp. 95–107). Springer Verlag. https://doi.org/10.1007/978-3-319-65340-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free