Detection and Classification of ADHD from EEG Signals Using Tunable Q-Factor Wavelet Transform
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The automatic identification of Attention Deficit Hyperactivity Disorder (ADHD) is essential for developing ADHD diagnosis tools that assist healthcare professionals. Recently, there has been a lot of interest in ADHD detection from EEG signals because it seemed to be a rapid method for identifying and treating this disorder. This paper proposes a technique for detecting ADHD from EEG signals with the nonlinear features extracted using tunable Q-wavelet transform (TQWT). The 16 channels of EEG signal data are decomposed into the optimal amount of time-frequency sub-bands using the TQWT filter banks. The unique feature vectors are evaluated using Katz and Higuchi nonlinear fractal dimension methods at each decomposed levels. An Artificial Neural Network classifier with a 10-fold cross-validation method is found to be an effective classifier for discriminating ADHD and normal subjects. Different performance metrics reveal that the proposed technique could effectively classify the ADHD and normal subjects with the highest accuracy. The statistical analysis showed that the Katz and Higuchi nonlinear feature estimation methods provide potential features that can be classified with high accuracy, sensitivity, and specificity and is suitable for automatic detection of ADHD. The proposed system is capable of accurately distinguishing between ADHD and non-ADHD subjects with a maximum accuracy of 100%.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it