Robust regression-based logarithmic estimators for efficient mean estimation in ranked set sampling

Accurate estimation of the population mean becomes challenging in the presence of outliers, especially when conventional estimators are implemented under simple random sampling. Ranked set sampling, known for its efficiency gains through judgment-based ranking, further suffers when extreme observations distort the estimation process. To address these issues, this study proposes a new class of robust regression-based logarithmic estimators for efficient population mean estimation under Ranked set sampling. The proposed estimators integrate robust regression techniques such as Huber-M, Huber-MM, least trimmed squares, least median of squares, Hampel-M, and Tukey-M with a logarithmic adjustment structure to minimize the impact of outliers while using auxiliary information. Theoretical properties such as bias and mean square error are derived under Ranked set sampling. Analytical efficiency comparisons demonstrate that the proposed class consistently achieves lower Mean sqaure error than several adapted families of robust estimators under Ranked set sampling. The theoretical results are validated with an extensive simulation study based on artificially generated symmetric and asymmetric populations and a real-data application with intentionally contaminated datasets, further validates the superiority of the proposed estimators.

Authors

Institutions

Publication Details

Journal
Hacettepe Journal of Mathematics and Statistics
Published
2026-08-18
DOI
https://doi.org/10.15672/hujms.1862503
Primary Topic
Survey Sampling and Estimation Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust regression-based logarithmic estimators for efficient mean estimation in ranked set sampling

Anoop Kumar, Renu Kumari
Hacettepe Journal of Mathematics and Statistics
Survey Sampling and Estimation Techniques
article

Robust regression-based logarithmic estimators for efficient mean estimation in ranked set sampling

Anoop Kumar, Renu Kumari
article en

Abstract

Accurate estimation of the population mean becomes challenging in the presence of outliers, especially when conventional estimators are implemented under simple random sampling. Ranked set sampling, known for its efficiency gains through judgment-based ranking, further suffers when extreme observations distort the estimation process. To address these issues, this study proposes a new class of robust regression-based logarithmic estimators for efficient population mean estimation under Ranked set sampling. The proposed estimators integrate robust regression techniques such as Huber-M, Huber-MM, least trimmed squares, least median of squares, Hampel-M, and Tukey-M with a logarithmic adjustment structure to minimize the impact of outliers while using auxiliary information. Theoretical properties such as bias and mean square error are derived under Ranked set sampling. Analytical efficiency comparisons demonstrate that the proposed class consistently achieves lower Mean sqaure error than several adapted families of robust estimators under Ranked set sampling. The theoretical results are validated with an extensive simulation study based on artificially generated symmetric and asymmetric populations and a real-data application with intentionally contaminated datasets, further validates the superiority of the proposed estimators.

Hacettepe Journal of Mathematics and Statistics(Advanced Online Publication)
Central University of Haryana (IN)
Openalex Percentile: Top 7%
Survey Sampling and Estimation Techniques
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.