An artificial neural network-based model to predict chronic kidney disease in aged cats
Bibliographic record
Abstract
BACKGROUND: Chronic kidney disease (CKD) frequently causes death in older cats; its early detection is challenging. OBJECTIVES: To build a sensitive and specific model for early prediction of CKD in cats using artificial neural network (ANN) techniques applied to routine health screening data. ANIMALS: Data from 218 healthy cats ≥7 years of age screened at the Royal Veterinary College (RVC) were used for model building. Performance was tested using data from 3546 cats in the Banfield Pet Hospital records and an additional 60 RCV cats-all initially without a CKD diagnosis. METHODS: Artificial neural network (ANN) modeling used a multilayer feed-forward neural network incorporating a back-propagation algorithm. Clinical variables from single cat visits were selected using factorial discriminant analysis. Independent submodels were built for different prediction time frames. Two decision threshold strategies were investigated. RESULTS: Input variables retained were plasma creatinine and blood urea concentrations, and urine specific gravity. For prediction of CKD within 12 months, the model had accuracy, sensitivity, specificity, positive predictive value (PPV) and negative predictive value (NPV) of 88%, 87%, 70%, 53%, and 92%, respectively. An alternative decision threshold increased specificity and PPV to 98% and 87%, but decreased sensitivity and NPV to 42% and 79%, respectively. CONCLUSIONS AND CLINICAL IMPORTANCE: A model was generated that identified cats in the general population ≥7 years of age that are at risk of developing CKD within 12 months. These individuals can be recommended for further investigation and monitoring more frequently than annually. Predictions were based on single visits using common clinical variables.
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.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 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.002 | 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 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".