Preprocessing Unbalanced Data using Support Vector Machine with Method K-Nearest Neighbors for Cerebral Infarction Classification
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Cerebral infarction is focal brain necrosis due to complete and prolonged ischemia that affects all tissue elements, neurons, glia, and vessels. Stroke infarction or known as cerebral infarction is a condition of damage in the brain due to insufficient oxygen supply, due to obstruction of blood flow to the area. Research shows stroke infarction does not only occur in the elderly, but occurs at a young age of around 15-55 years, especially with certain risk factors, such as diabetes, hypertension, heart disease, smoking, and long-term alcohol consumption. In diagnosing the presence of cerebral infarction in the brain, machine learning is used because it is not enough just to use a CT scan to diagnose. Therefore, it requires timely detection and more accurate methods of classification. This study aims to use Support Vector Machine (SVM) as preprocessing and K-Nearest Neighbors (KNN) algorithm to classify Infarction Cerebral. In this study, discusses the application of SVM to deal with class imbalances. The first strategy is to balance data using SVM as a preprocessor and the actual target value of the training data is then replaced by trained SVM predictions. Then, the modified training data is used to classify with K-NN method. We use data CT scan result from a Department of Radiology at Dr. Cipto Mangunkusumo Hospital (RSCM). This accuracy in this paper shows around 69,85 %.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.005 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it