Relations for Moments of Progressively Type-II Censored Order Statistics from Log-Logistic Distribution with Applications to Inference
Bibliographic record
Abstract
In this article, we establish several recurrence relations for the single and product moments of progressively Type-II right censored order statistics from a log-logistic distribution. The use of these relations in a systematic recursive manner would enable the computation of all the means, variances and covariances of progressively Type-II right censored order statistics from the log-logistic distribution for all sample sizes n, effective sample sizes m, and all progressive censoring schemes (R 1,…, R m ). The results established here generalize the corresponding results for the usual order statistics due to Balakrishnan and Malik (1987 Balakrishnan , N. , Malik , H. J. ( 1987 ). Moments of order statistics from truncated log-logistic distribution . J. Statist. Plann. Infer. 17 : 251 – 267 .[Crossref], [Web of Science ®] , [Google Scholar]) and Balakrishnan et al. (1987 Balakrishnan , N. , Malik , H. J. , Puthenpura , S. ( 1987 ). Best linear unbiased estimation of location and scale parameters of the log-logistic distribution . Commun. Statist. Theor. Meth. 16 : 3477 – 3495 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]). The moments so determined are then utilized to derive best linear unbiased estimators for the scale- and location-scale log-logistic distributions. A comparison of these estimates with the maximum likelihood estimates is made through Monte Carlo simulation. The best linear unbiased predictors of progressively censored failure times is then discussed briefly. Finally, a numerical example is presented to illustrate all the methods of inference developed here.
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.014 | 0.114 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.004 | 0.004 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.004 | 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".