Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1126033164.pdf (644.41 KB)

ETD Abstract Container

Abstract Header

Minimum disparity inference for discrete ranked set sampling data

Alexandridis, Roxana Antoanela
http://rave.ohiolink.edu/etdc/view?acc_num=osu1126033164

Abstract Details

2005, Doctor of Philosophy, Ohio State University, Statistics.
Ranked set sampling (RSS) is a sampling scheme which can successfully replace simple random sampling (SRS) in experimental settings where measuring the units of interest is difficult, expensive, or time consuming, but ranking small subsets of units is relatively easy and inexpensive. Under perfect ranking, the statistical inference based on a RSS data is more efficient than the inference based on a SRS data of equal size. In practice, the ranking process is most likely subject to errors, and the efficiency of the inference decreases with the decrease in the quality of the ranking procedure. Thus, the central issue of a parametric inference is to balance the two ideals: efficiency when the ranking is perfect, and robustness when the ranking is imperfect. Typically there is a trade-off between these two ideals. In order to address this issue, we develop robust statistical inference based on a RSS data from a family of discrete distributions. Our inference relies on minimum disparity functions that measure the distance between the empirical and model distributions. We develop a class of estimators obtained by minimizing disparities between the assumed and empirical models. We show that all minimum disparity estimators are asymptotically efficient at the correct model under perfect ranking. We also show that there exists an estimator within this class, the minimum Hellinger distance estimator, that produces substantially smaller bias than the bias of the maximum likelihood estimator under imperfect ranking. In addition to robust estimation, we also developed a class of testing procedures, referred to as disparity deviance tests, to test certain hypotheses about the parameters of a family of discrete distributions. We show that under perfect ranking, the disparity deviance tests have the same asymptotic null distribution as the likelihood ratio test. Furthermore, we show that the disparity deviance test based on the Hellinger distance is more stable to imperfect ranking than the likelihood ratio test. We provide finite sample simulation results to evaluate the performance of the proposed procedures.
Omer Ozturk (Advisor)
Statistics
Bias; Mean square error; Hellinger distance; Imperfect ranking; Robustness; Minimum distance estimation

Recommended Citations

Citations

  • Alexandridis, R. A. (2005). Minimum disparity inference for discrete ranked set sampling data [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1126033164

    APA Style (7th edition)

  • Alexandridis, Roxana. Minimum disparity inference for discrete ranked set sampling data. 2005. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1126033164.

    MLA Style (8th edition)

  • Alexandridis, Roxana. "Minimum disparity inference for discrete ranked set sampling data." Doctoral dissertation, Ohio State University, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=osu1126033164

    Chicago Manual of Style (17th edition)

osu1126033164
1,033
© 2005, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.