Premium
Subset Selection for Exponential Populations: Determination of the Selection Constant
Author(s) -
van der Laan Paul
Publication year - 1995
Publication title -
biometrical journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.108
H-Index - 63
eISSN - 1521-4036
pISSN - 0323-3847
DOI - 10.1002/bimj.4710370502
Subject(s) - selection (genetic algorithm) , constant (computer programming) , mathematics , statistics , exponential function , population , value (mathematics) , computer science , mathematical analysis , artificial intelligence , demography , sociology , programming language
Given are k(≧2) exponential populations differing only in their location parameter. One wishes to choose the best one, that is the population with the largest value of the location parameter. A possible method for solving this problem is to select a subset of the k populations of size at least one which includes the best population with a required confidence P *(k −1 ≤ P * ≤1). In this paper the required selection constant is determined for different values of k and P *. Also an approximation for the selection constant is derived. A comparison with the exact results is made.