Automatic detection of attention deficit hyperactivity disorder using machine learning algorithms based on short time
Manjusha Deshmukh1, Mahi Khemchandani2
1Computer Engineering Department, Saraswati College of Engineering, Navi Mumbai, India.
Applied Neuropsychology. Child
|March 11, 2025
Summary
Electroencephalography (EEG) decomposition using STFT shows promise for automated ADHD detection in minors. Machine learning algorithms achieved up to 91% accuracy, aiding early diagnosis.
Area of Science:
- Neuroscience
- Biomedical Engineering
- Machine Learning
Background:
- Attention deficit hyperactivity disorder (ADHD) is a common neurodevelopmental disorder in children and adolescents.
- Overlapping symptoms complicate traditional ADHD diagnosis.
- Electroencephalography (EEG) offers a non-invasive method for assessing brain activity and potential automated diagnosis.
Purpose of the Study:
- To investigate electroencephalogram (EEG) decomposition techniques for improved ADHD detection.
- To evaluate the efficacy of machine learning algorithms in distinguishing ADHD patients from healthy individuals using processed EEG data.
Main Methods:
- EEG signals were processed using Independent Component Analysis (ICA) to remove noise and artifacts.
- EEG signals were decomposed into subbands using Short-Time Fourier Transform (STFT) and Discrete Cosine Transform (DCT).
- Decomposed subbands and raw EEG signals served as input for machine learning classifiers (XGBoost, Logistic Regression, Random Forest).
Main Results:
- STFT decomposition methods demonstrated superior performance compared to DCT.
- The STFT-XGBoost model achieved 91% accuracy with 6 electrode placements (Fp1Fp2F3F4P3C3).
- Other electrode combinations and classifiers (Logistic Regression, Random Forest) also showed high accuracy, ranging from 88% to 89%.
Conclusions:
- Automated EEG analysis using STFT decomposition and machine learning shows significant potential for ADHD diagnosis.
- This technology could enhance early detection and personalized treatment strategies for ADHD.
- The proposed method offers a novel, non-invasive tool for future clinical application in ADHD diagnosis.
Related Concept Videos
Attention-Deficit/Hyperactivity Disorder
34
Attention-deficit/hyperactivity disorder (ADHD) is a neurodevelopmental disorder characterized by persistent inattention, hyperactivity, and impulsivity. It affects approximately 5-8% of children globally, with around 60-70% of cases persisting into adulthood. ADHD has significant implications for educational attainment, social interactions, and occupational success.
Diagnostic Criteria and Symptoms
To diagnose ADHD, symptoms must manifest before age 12 and be evident across multiple settings....
Diagnostic Criteria and Symptoms
To diagnose ADHD, symptoms must manifest before age 12 and be evident across multiple settings....
34
Discrete-time Fourier transform
249
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
249
Discrete Fourier Transform
200
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
200
Discrete-Time Fourier Series
208
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
208
Fast Fourier Transform
244
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
244


