Implementation of Mechine Learning Eligibility for Customer Credit Payments at Bank BTN Using the K – Nearst Neighbor Algorithm
Bibliographic record
Abstract
Credit is the provision of money or bills that can be equated with that, based on a loan agreement or agreement between a bank and another party that requires the borrower to pay off the debt after a certain period of time with interest (Government of Indonesia, 1998). In its initial development, credit had a function in stimulating mutual assistance aimed at meeting needs, both in the field of business and meeting daily needs.In developing applications, it is necessary to predict applications at Bank BTN Medan accurately, accurate prediction results are very important in showing the right rating and decision-making in selecting customers. When customers experience arrears, the system used by Bank BTN Medan is still manual and has not applied predication in credit arrears to customers of Bank BTN Medan. Tests carried out in this test use a credit customer dataset from Bank BTN Medan. This study predicts the eligibility of customer credit payments at Bank BTN with the K – Nearst neighbor algorithm. The prediction of the level of smoothness of credit payments is made using K-Nearest Neighbor in order to be able to predict the smoothness of future credit payments.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 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.005 | 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".