Mental stress detection from ultra-short heart rate variability using explainable graph convolutional network with network pruning and quantisation
Mental stress detection from ultra-short heart rate variability using explainable graph convolutional network with network pruning and quantisation
This study introduces a novel pruning approach based on explainable graph convolutional networks, strategically amalgamating pruning and quantisation, aimed to tackle the complexities associated with existing machine learning and deep learning models for stress detection using ultra-short heart rate variability analysis. These complexities often impede the implementation ability of such models on resource-limited devices. The proposed method exhibits exceptional performance, demonstrating high accuracy (97.75%) and efficiency (97.66%) on the WESAD dataset, along with an impressive accuracy (94.48%) and efficiency (94.39%) on the SWELL dataset. Importantly, the runtime complexity saw a significant reduction, down by 63.4% and 69.34% compared to the original model. The proposed method's notable advantage lies in its ability to retain nearly all of the initial model's performance with negligible loss, even when the pruning levels are below 60%. This innovative approach, thus, offers a promising solution for effective stress detection, specifically designed to operate smoothly on devices with limited resources.
Explainability, Graph convolution network, Pruning, Quantisation, Stress detection
5467-5494
Adarsh, V.
a847847c-cb23-4eb4-b06b-ae6ad7e6fbc6
Gangadharan, G.R.
8bfd2f88-da93-4ecb-b26b-62cd5fd11b58
Adarsh, V.
a847847c-cb23-4eb4-b06b-ae6ad7e6fbc6
Gangadharan, G.R.
8bfd2f88-da93-4ecb-b26b-62cd5fd11b58
Adarsh, V. and Gangadharan, G.R.
(2024)
Mental stress detection from ultra-short heart rate variability using explainable graph convolutional network with network pruning and quantisation.
Machine Learning, 113 (8), .
(doi:10.1007/s10994-023-06504-9).
Abstract
This study introduces a novel pruning approach based on explainable graph convolutional networks, strategically amalgamating pruning and quantisation, aimed to tackle the complexities associated with existing machine learning and deep learning models for stress detection using ultra-short heart rate variability analysis. These complexities often impede the implementation ability of such models on resource-limited devices. The proposed method exhibits exceptional performance, demonstrating high accuracy (97.75%) and efficiency (97.66%) on the WESAD dataset, along with an impressive accuracy (94.48%) and efficiency (94.39%) on the SWELL dataset. Importantly, the runtime complexity saw a significant reduction, down by 63.4% and 69.34% compared to the original model. The proposed method's notable advantage lies in its ability to retain nearly all of the initial model's performance with negligible loss, even when the pruning levels are below 60%. This innovative approach, thus, offers a promising solution for effective stress detection, specifically designed to operate smoothly on devices with limited resources.
This record has no associated files available for download.
More information
Accepted/In Press date: 16 December 2023
e-pub ahead of print date: 22 January 2024
Keywords:
Explainability, Graph convolution network, Pruning, Quantisation, Stress detection
Identifiers
Local EPrints ID: 495877
URI: http://eprints.soton.ac.uk/id/eprint/495877
PURE UUID: 60145d73-c7d7-40eb-bc5f-5e412f73db4e
Catalogue record
Date deposited: 26 Nov 2024 17:45
Last modified: 27 Nov 2024 03:10
Export record
Altmetrics
Contributors
Author:
V. Adarsh
Author:
G.R. Gangadharan
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics