Complex wavelet algorithm for computer‐aided diagnosis of Alzheimer's disease
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
Electroencephalography signals are used for computer‐aided diagnosis of Alzheimer's disease. Therefore, extracting critical features that belong to Alzheimer's signals are useful and tedious for neural network classification due to the high‐frequency non‐stationary components. For this purpose, time–frequency analysis and the multi‐resolution capability of wavelets represent an attractive choice. However, fluctuations of the transformed coefficients and the absence of phase information make the process less accurate in certain scenarios. Because of this, complex wavelet transform has been selected to handle Alzheimer's signals. Moreover, the importance of calculating an optimal threshold value has been highlighted, usually by means of Shannon entropy as a helpful threshold identifier of the complex wavelet transform used to produce significant results. The effectiveness of Tsallis entropy instead of Shannon entropy in handling Alzheimer's signals is evaluated, the former giving place to better features for neural network classification. As a result, accuracy has been improved from 90 to 95% using Tsallis entropy. Hence, this new proposal boosts the opportunity to reduce mortality rates by detecting the disease accurately.
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