Statistical inference for the generalized exponential distribution using ordered lower k-record ranked set sampling with random sample sizes

This article presents an innovative sampling strategy, ordered moving extremes lower k-record ranked set sampling, designed to enhance parameter estimation and prediction for the generalized exponential distribution. By incorporating k-record values with random sample sizes, we develop maximum likelihood estimation, classical Bayes estimation, and empirical Bayes estimators, leveraging informative priors under balanced loss functions, including balanced squared error and balanced linear exponential. Additionally, we utilize the pivotal prediction method to construct prediction intervals for future observations under double type-II censoring. Extensive simulation studies demonstrate that our approach significantly improves estimation accuracy by achieving lower mean squared errors and reduced bias compared to conventional methods. The efficacy of the proposed sampling method is further validated through its application to real-world medical datasets, showcasing its practical utility in enhancing statistical inferences for lifetime data analysis. The key findings highlight that ordered moving extremes lower k-record ranked set sampling effectively balances efficiency and accuracy, making it particularly well-suited for reliability studies and survival analysis.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-05-30
DOI
https://doi.org/10.1038/s41598-025-01995-z
Primary Topic
Statistical Distribution Estimation and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Statistical inference for the generalized exponential distribution using ordered lower k-record ranked set sampling with random sample sizes

Haidy A. Newer
Scientific Reports
Statistical Distribution Estimation and Applications
article

Statistical inference for the generalized exponential distribution using ordered lower k-record ranked set sampling with random sample sizes

Haidy A. Newer
article en

Abstract

This article presents an innovative sampling strategy, ordered moving extremes lower k-record ranked set sampling, designed to enhance parameter estimation and prediction for the generalized exponential distribution. By incorporating k-record values with random sample sizes, we develop maximum likelihood estimation, classical Bayes estimation, and empirical Bayes estimators, leveraging informative priors under balanced loss functions, including balanced squared error and balanced linear exponential. Additionally, we utilize the pivotal prediction method to construct prediction intervals for future observations under double type-II censoring. Extensive simulation studies demonstrate that our approach significantly improves estimation accuracy by achieving lower mean squared errors and reduced bias compared to conventional methods. The efficacy of the proposed sampling method is further validated through its application to real-world medical datasets, showcasing its practical utility in enhancing statistical inferences for lifetime data analysis. The key findings highlight that ordered moving extremes lower k-record ranked set sampling effectively balances efficiency and accuracy, making it particularly well-suited for reliability studies and survival analysis.

Scientific ReportsVol. 15(1)
Ain Shams University (EG)
Ain Shams University
Peace, Justice and strong institutions
Openalex Percentile: Top 88%
Statistical Distribution Estimation and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.