Enhancing Cardiac Arrhythmia Detection in WBAN Sensors Through Supervised Machine Learning and Data Dimensionality Reduction Techniques
Bibliographic record
Abstract
In recent years, the global medical community has endeavored to provide swift and efficient patient care by leveraging real-time patient databases.However, the efficacy of these systems, particularly wireless body area network (WBAN) sensors, has been undermined by inaccurate and low-performance readings, leading to unnecessary alarm triggers.This study scrutinizes the potential of data dimensionality reduction techniques and machine learning algorithms in augmenting the detection accuracy of cardiac abnormalities in WBAN sensors.Dimensionality reduction was performed using principal component analysis (PCA), independent component analysis (ICA), and spatial correlation methods.For arrhythmia prediction, Decision Tree and Multilayer Perceptron algorithms were implemented and their performance compared.Numerical simulations and Python code analysis revealed that the application of data reduction techniques significantly improved the reliability and effectiveness of WBAN sensors in handling voluminous datasets.Furthermore, the use of PCA, ICA, and spatial correlation strategies notably reduced WBAN sensor battery energy consumption, data storage needs, computational complexity, and processing time.These pragmatic solutions could potentially empower healthcare practitioners to intervene proactively before patients encounter life-threatening conditions.The results also demonstrated that feature selection effectively eliminated irrelevant attributes from noisy Electrocardiograms (ECGs), thereby enhancing the precision of the analyses.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".