Heart disease detection based on internet of things data using linear quadratic discriminant analysis and a deep graph convolutional neural network
Bibliographic record
Abstract
Heart disease is an emerging health issue in the medical field, according to WHO every year around 10 billion people are affected with heart abnormalities. Arteries in the heart generate oxygenated blood to all body parts, however sometimes blood vessels become clogged or restrained due to cardiac issues. Past heart diagnosis applications are outdated and suffer from poor performance. Therefore, an intelligent heart disease diagnosis application design is required. In this research work, internet of things (IoT) sensor data with a deep learning-based heart diagnosis application is designed. The heart disease IoT sensor data is collected from the University of California Irvine machine learning repository free open-source dataset which is useful for training the deep graph convolutional network (DG_ConvoNet) deep learning network. The testing data has been collected from the Cleveland Clinic Foundation; it is a collection of 350 real-time clinical instances from heart patients through IoT sensors. The K-means technique is employed to remove noise in sensor data and clustered the unstructured data. The features are extracted to employ Linear Quadratic Discriminant Analysis. DG_ConvoNet is a deep learning process to classify and predict heart diseases. The diagnostic application achieves an accuracy of 96%, sensitivity of 80%, specificity of 73%, precision of 90%, F-Score of 79%, and area under the ROC curve of 75% implementing the proposed model.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| 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.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".