An ensemble approach for detection of diabetes using SVM and DT
Bibliographic record
Abstract
As diabetes affects the health of the entire population, it is a chronic disease that is still an important worldwide health issue. Diabetes increases the possibility of long-term complications, such as kidney failure and heart disease. If this disease is discovered early, people may live longer and in better health. In order to detect and prevent particular diseases, machine learning (ML) has become essential. An ensemble approach for detection of diabetes using support vector machine (SVM) and decision tree (DT) presents in this paper. In this case, to identify diabetes, two ML techniques are DT and SVM have been combined with an ensemble classifier. They obtain the information, they require from the Public Health Institute’s statistics area. There are 270 records, or instances, in the collection. This dataset includes the following attributes: age, a body mass index (BMI) glucose, and insulin. The development of a system that predictions a patient’s risk of diabetes is the goal of this analysis. Several performance metrics, including F1-score, recall, accuracy, and precision, were used to achieve this. From overall results, 96% of precision, 97% of accuracy, 96% of F1-score, and 97% of recall values are the results achieved for the ensemble model (SVM+DT) which is more effective than other individual ML models as DT and SVM.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".