Validation of case definition algorithms for the ascertainment of congenital anomalies
Bibliographic record
Abstract
BACKGROUND: Congenital anomalies (CA) are one of the leading causes of infant mortality and long-term disability. Many jurisdictions rely on health administrative data to monitor these conditions. Case definition algorithms can be used to monitor CA; however, validation of these algorithms is needed to understand the strengths and limitations of the data. This study aimed to validate case definition algorithms used in a CA surveillance system in British Columbia (BC), Canada. METHODS: A cohort of births between March 2000 and April 2002 in BC was linked to the Health Status Registry (HSR) and the BC Congenital Anomalies Surveillance System (BCCASS) to identify cases and non-cases of specific anomalies within each surveillance system. Measures of algorithm performance were calculated for each CA using the HSR as the reference standard. Agreement between both databases was calculated using kappa coefficient. The modified Standards for Reporting Diagnostic Accuracy guidelines were used to enhance the quality of the study. RESULTS: Measures of algorithm performance varied by condition. Positive predictive value (PPV) ranged between approximately 73%-100%. Sensitivity was lower than PPV for most conditions. Internal congenital anomalies or conditions not easily identifiable at birth had the lowest sensitivity. Specificity and negative predictive value exceeded 99% for all algorithms. CONCLUSION: Case definition algorithms may be used to monitor CA at the population level. Accuracy of algorithms is higher for conditions that are easily identified at birth. Jurisdictions with similar administrative data may benefit from using validated case definitions for CA surveillance as this facilitates cross-jurisdictional comparison.
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.241 | 0.487 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.007 | 0.005 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.005 | 0.004 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".