Research on Local Field Potential Signal Classification Algorithm Based on Transfer Learning
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 local field potential signals (LFPs), as a vital signal for studying the mechanisms of deep brain stimulation (DBS) and constructing adaptive DBS contain information related to the motor symptoms of Parkinson's disease (PD). This paper proposed a Parkinson's disease state recognition algorithm based on the idea of transfer learning.The algorithm uses continuous wavelet transform (CWT) to convert one-dimensional LFPs into two-dimensional gray-scalogram images and color images respectively, and adds a Bayesian optimized random forest (RF) classifier to replace the three fully connected layers used in the classification task in the VGG16 model, to realize the pathologic status identification of PD and normal state of parkinsonian patients. It was found that consistently superior performance of gray-scalogram images over color images. The proposed algorithm achieved an impressive accuracy of 97.76%, outperforming feature extractors such as VGG19, InceptionV3, ResNet50, and the lightweight network MobileNet. This algorithm has high accuracy and can monitor the status of patients in real time without manual feature extraction, and only apply DBS stimulation when in PD state, effectively improving the closed-loop adaptive DBS treatment effect.
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.001 | 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.001 |
| 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