SVM-Based Validation of Motor Unit Potential Trains Extracted by EMG Signal Decomposition
Bibliographic record
Abstract
Motor unit potential trains (MUPTs) extracted via electromyographic (EMG) signal decomposition can aid in the diagnosis of neuromuscular disorders and the study of the neural control of movement, but only if they are valid. In this paper, support vector machine (SVM)-based supervised classifiers are proposed to estimate the validity of extracted MUPTs. The classifiers use either the MU firing pattern or the MUP shape consistency of an MUPT, or both, to estimate its validity. The developed classifiers estimate the class label of an MUPT (i.e., valid/invalid) and a degree of support for the decision being made. A single SVM that estimates the validity of a given MUPT using extracted MU firing pattern and MUP shape features was investigated. In addition, the effectiveness of multiclassifier techniques which estimate the overall validity of a train by fusing the MU firing pattern and MUP shape validity of a given MUPT, determined separately by two distinct SVMs, was also investigated. Training based only on simulated data showed robust classification performance of the several multiclassifier methods when tested using both simulated and real test data. Of the methods studied, the multiclassifier constructed using trainable logistic regression to aggregate base classifier outputs had the best performance. Assuming 12.7% of extracted MUPTs are on average invalid, the estimated accuracy for this method in correctly categorizing MUPTs extracted during decomposition was 99.4% and 98.8% for simulated and real data, respectively.
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.
How this classification was reachedexpand
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".