Do you want to publish a course? Click here

Estimating the rate of defects under imperfect sampling inspection - a new approach

228   0   0.0 ( 0 )
 Added by Guy Katriel
 Publication date 2017
and research's language is English




Ask ChatGPT about the research

We consider the problem of estimating the rate of defects (mean number of defects per item), given the counts of defects detected by two independent imperfect inspectors on one sample of items. In contrast with the setting for the well-known method of Capture-Recapture, we {it{do not}} have information regarding the number of defects jointly detected by {it{both}} inspectors. We solve this problem by constructing two types of estimators - a simple moment-type estimator, and a complicated maximum-likelihood estimator. The performance of these estimators is studied analytically and by means of simulations. It is shown that the maximum-likelihood estimator is superior to the moment-type estimator. A systematic comparison with the Capture-Recapture method is also made.



rate research

Read More

To develop decision rules regarding acceptance or rejection of production lots based on sample data is the purpose of acceptance sampling inspection plan. Dependent sampling procedures cumulate results from several preceding production lots when testing is expensive or destructive. This chaining of past lots reduce the sizes of the required samples, essential for acceptance or rejection of production lots. In this article, a new approach for chaining the past lot(s) results proposed, named as modified chain group acceptance sampling inspection plan, requires a smaller sample size than the commonly used sampling inspection plan, such as group acceptance sampling inspection plan and single acceptance sampling inspection plan. A comparison study has been done between the proposed and group acceptance sampling inspection plan as well as single acceptance sampling inspection plan. A example has been given to illustrate the proposed plan in a good manner.
The problem of adaptive sampling for estimating probability mass functions (pmf) uniformly well is considered. Performance of the sampling strategy is measured in terms of the worst-case mean squared error. A Bayesian variant of the existing upper confidence bound (UCB) based approaches is proposed. It is shown analytically that the performance of this Bayesian variant is no worse than the existing approaches. The posterior distribution on the pmfs in the Bayesian setting allows for a tighter computation of upper confidence bounds which leads to significant performance gains in practice. Using this approach, adaptive sampling protocols are proposed for estimating SARS-CoV-2 seroprevalence in various groups such as location and ethnicity. The effectiveness of this strategy is discussed using data obtained from a seroprevalence survey in Los Angeles county.
This paper develops a particle filter maximum likelihood estimator for the competitive storage model. The estimator is suitable for inference problems in commodity markets where only reliable price data is available for estimation, and shocks are temporally dependent. The estimator efficiently utilizes the information present in the conditional distribution of prices when shocks are not iid. Compared to Deaton and Laroques composite quasi-maximum likelihood estimator, simulation experiments and real-data estimation show substantial improvements in both bias and precision. Simulation experiments also show that the precision of the particle filter estimator improves faster than for composite quasi-maximum likelihood with more price data. To demonstrate the estimator and its relevance to actual data, we fit the storage model to data set of monthly natural gas prices. It is shown that the storage model estimated with the particle filter estimator beats, in terms of log-likelihood, commonly used reduced form time-series models such as the linear AR(1), AR(1)-GARCH(1,1) and Markov Switching AR(1) models for this data set.
We present a new design and inference method for estimating population size of a hidden population best reached through a link-tracing design. The strategy involves the Rao-Blackwell Theorem applied to a sufficient statistic markedly different from the usual one that arises in sampling from a finite population. An empirical application is described. The result demonstrates that the strategy can efficiently incorporate adaptively selected members of the sample into the inference procedure.
A new strategy is introduced for estimating population size and networked population characteristics. Sample selection is based on a multi-wave snowball sampling design. A generalized stochastic block model is posited for the populations network graph. Inference is based on a Bayesian data augmentation procedure. Applications are provided to an empirical and simulated populations. The results demonstrate that statistically efficient estimates of the size and distribution of the population can be achieved.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا