JARINGAN SYARAF TIRUAN UNTUK MEMPREDIKSI NILAI KELULUSAN SIDANG (STUDI KASUS : STMIK KAPUTAMA BINJAI )
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
Thesis session is a process that must be followed by a student in order to account for the thesis that has been done. Thesis trial scores determine student graduation, and student graduation rates are used as a measure of campus quality. The problem is that many students are depressed and afraid in the face of a thesis hearing, not a few among students who are stressed in facing thesis and some even delay the work of the thesis so that it affects the trial value obtained. Besides that there are students who have good IP but the trial value is not good, and vice versa. This method the Artificial Neural Network using the Backpropagation algorithm was chosen because it was able to predict the graduation value of the thesis trial based on input from the value of the semester IP from semester I to semester VII and the value of the trial. The study was conducted in two ways, namely training and testing. The training process aims to recognize or look for expected results by using a lot of training, so that it will produce the best pattern for training the data. After the training reaches the goal based on the best pattern, it will be tested with new data to see the accuracy between the targets using Matlab R2014a software. Based on the results of testing using Matlab R2014a software, the results are convergent, with a target error of 0. 2 . From the results of the training and the tests carried out, it was predicted that the graduation score of the thesis trial was predicted to be 0.8 727 . This research can also help predict the graduation score of thesis students at STMIK Kaputama Binjai
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.012 |
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