On the identifiability of start-up demonstration mixture models

DOI10.1007/S10463-016-0569-6MaRDI QIDQ2409392zbMATH OpenOpenAlexFDO

Authors F. S. Milienos, Narayanaswamy Balakrishnan, Markos V. Koutras

Publication date 11 October 2017

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10463-016-0569-6

zbMATH Keywords

EM algorithmi.i.d. binary trialsidentifiabilitymaximum likelihood methodmixture modelsstart-up demonstration testswaiting time distributions

Mathematics Subject Classification ID

Testing in survival analysis and censored data (62N03) Reliability and life testing (62N05) Reliability, availability, maintenance, inspection in operations research (90B25)

Review text

The authors consider start-up demonstration testing -- a technique for assessing the reliability of a manufactured unit through its performance on successive start-ups. This performance is taken into account and several different types of decision criteria (most of them inspired by the theory of runs and scans) for accepting or rejecting the unit are introduced. The authors study binary start-up demonstration tests, assuming that they have at hand two different types of units with potentially different probabilities of successful start-up. In this case, the waiting time distributions are expressed as two-component mixture models and their identifiability is discussed. An estimation method based on the Expectation-Maximization algorithm (EM algorithm) for the model parameters is described and some numerical examples are presented.

Recommendations

• Start-up demonstration tests with three-level classification
• Some binary start-up demonstration tests and associated inferential methods
• Statistical inference for start-up demonstration tests with rejection of units upon observingdfailures
• On generalized start-up demonstration tests
• The analysis and comparison of start-up demonstration tests

Cites work

• Application of auxiliary Markov chains to start-up demonstration tests
• Distribution theory of runs and patterns and its applications. A finite Markov chain imbedding approach
• Finite mixture models
• scientific article; zbMATH DE number 3591262 (Why is no real title available?)
• scientific article; zbMATH DE number 273667 (Why is no real title available?)
• Identifiability of Finite Mixtures
• Markovian start-up demonstration tests with rejection of units upon observing \(d\) failures.
• On generalized start-up demonstration tests
• On the Identifiability of Finite Mixtures
• Runs and scans with applications
• Some binary start-up demonstration tests and associated inferential methods
• Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials
• Start-up demonstration tests under Markov dependence model with corrective actions
• Start-up demonstration tests with rejection of units upon observing \(d\) failures

Cited in

(1)

• Some binary start-up demonstration tests and associated inferential methods

This page was built for publication: On the identifiability of start-up demonstration mixture models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409392)