Minorize–maximize algorithm for the generalized odds rate model for clustered current status data
Bibliographic record
Abstract
Abstract Current status data are widely used in epidemiology and public health, where the only observable information is the random inspection time and the event status at inspection. This article presents a unified methodology to analyze such complex data subject to clustering. Given the random clustering effect, the time to event is assumed to follow a semiparametric generalized odds rate (GOR) model. The nonparametric component of the GOR model is approximated via penalized splines, with a set of knot points that increase with the sample size. The within‐subject correlation is accounted for by a random (frailty) effect. For estimation, a novel MM algorithm is developed that allows the separation of the parametric and nonparametric components of the model. This separation makes the problem conducive to applying the Newton–Raphson algorithm that quickly returns the roots. The work is accompanied by a complexity analysis of the algorithm, a rigorous asymptotic proof, and the related semiparametric efficiency of the proposed methodology. The finite sample performance of the proposed method is assessed via simulation studies. Furthermore, the proposed methodology is illustrated via real data analysis on periodontal disease studies accompanied by diagnostic checks to identify influential observations.
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.011 | 0.025 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.004 | 0.004 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
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".