Classification For Predicting Heart Disease Using The K Nearest Neighbor Method Sylvani General Hospital Binjai City
Bibliographic record
Abstract
The heart is a hollow organ and has four chambers or chambers located between the two lungs in the middle of the thoracic cavity. The heart has an important function in the human body, namely as a pump that presses blood so that it can flow to all parts of the body through arteries or veins. Disease caused by plaque buildup in the coronary arteries which supply oxygen to the heart muscle, resulting in severe damage to the heart is called coronary heart disease. Many factors can increase the risk of heart disease. These risk factors consist of risk factors that cannot be modified such as family history, age and gender and risk factors that can be modified such as hypertension, smoking habits, diabetes, dyslipidemia, obesity, lack of physical activity, diet and stress. K-Nearest Neighbor is a method for classifying new objects based on their (K) closest neighbors. K-NN includes a Supervised Learning algorithm where the results of querying new instances are classified based on the majority of categories in KNN. The class that appears the most will be the classification result class. This algorithm only stores feature vectors and classifies the learning data. In the classification phase, the same features are calculated for the test data (whose classification is unknown). The distance of this new vector to all data vectors is calculated, and the k closest ones are taken. The newly classified point is predicted to be among the most classified of these points. From the data with the majority categories there are Positive and Negative categories. From the majority number (Positive > Negative) it can be concluded that new data (data No. 20) (K1=1, K2=0.5, K3=0, K4=1, K5=0, K6=1, K7=0, 5, K8=1) is included in the Positive category.
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.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.004 |
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".