A Framework for Blended Sub Feature Engineering for Chronic Disease Prediction Using in-Memory Computing
Bibliographic record
Abstract
Chronic diseases are among the most frequent major health concerns.Early detection of chronic illnesses can help to avoid or lessen their repercussions, potentially lowering death rates.It's an innovative technique to use machine learning algorithms to identify dangerous variables.The problem with existing feature selection procedures is that each method gives a unique collection of features that influence model validity, and current methods are incapable of performing effectively on large multidimensional datasets.We would want to present a novel model that uses a feature selection strategy to choose ideal features from large multidimensional data sets to deliver credible forecasts of chronic diseases while preserving the uniqueness of the data.To assure the success of our proposed model, we used balanced classes by applying hybrid balanced class sampling methods to the original dataset, as well as methods to provide valid data for the training model, characterization and data conversion are required.Our model was run and assessed on datasets with binary and multi-valued classifications.We utilized a variety of datasets (Parkinson's disease, arrhythmia, breast cancer, kidney disease, and diabetes).To select suitable features, the hybrid feature model is used, which includes six ensemble models and involves voting on attributes.The accuracy of the original dataset before applying the framework is recorded and compared to the accuracy of the reduced set of characteristics.The findings are given individually to allow for comparisons.We can conclude from the results that our proposed model performed best on multi-valued class datasets rather than binary class characteristics.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".