Analysis and Prediction of Heart Disease Using Machine Learning and Data Mining Techniques
Bibliographic record
Abstract
In clinical, sciences expectation of heart malady is one of the foremost troublesomeundertakings. Nowadays, coronary illness may be a significant reason for bleakness andmortality in present-day society. Coronary illness could be a term that doles intent on countlessailments identified with the heart. Clinical determination is incredibly a big, however entanglederrand that must be performed precisely, effectively, and unequivocally. Although hugeadvancement has been imagined within the finding and treatment of coronary illness, furtherexamination is required. The accessibility of enormous measures of clinical informationprompts the requirement for amazing information examination instruments to get ridof valuable information. Coronary illness determination is one in all the applications whereinformation mining and AI instruments have demonstrated victories. This study used themachine learning algorithms KNN, Naïve Bayes, Random forest, Logistic regression, Supportvector machine, J48, and Decision tree by WEKA software to spot which method providesmaximum performance and accuracy. Using these algorithms with WEKA software, we madean ensemble (Vote) hybrid model by combining individual methods. Our research aims toaccess the effectiveness of various machine learning algorithms to diagnose the center diseaseand find the feasible algorithm, which is that the best for a heart condition
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.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 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.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".