Pendugaan Koefisien Regresi Logistik Biner Menggunakan Algoritma Least Angle Regression
Bibliographic record
Abstract
Binary logistic regression is a statistical analysis method that aims to determine the relationship between variable which has two categories with the predictor variable that have categorical or continuous scale. The method that used to estimate logistic regression parameters is Maximum Likelihood Estimation (MLE) method. In estimating parameters, Least Angle Regression (LAR) algorithm is used to select the significant variables in order to get the best model from the estimation results of binary logistic regression coefficients. This LAR algorithm is applied to the risko of stunting data in two-year-old-babies at Buntu Batu Health Center working area, Enrekang Regency, South Sulawesi in 2019. This results obtained in the estimation of binary logistic regression prediction model using LAR algorithm, the standard error value is 0.018 smaller than the standard error value of binary logistic regression, which is 0.025. This shows that the binary logistic regression model using LAR algorithm is better than the usual binary logistic regression model on the risk of stunting data. Based on the results obtained, the variables that significantly affect the risk of stunting in two-year-old-babies on 2019 are father’s height, body length of birth, exclusive breastfeeding, history of infectious diseases, and history of immunization.
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.004 | 0.007 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.013 | 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".