Skip Navigation

Biometrika 1974 61(1):191-193; doi:10.1093/biomet/61.1.191
© 1974 by Biometrika Trust
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by SHUSTER, J. J.
Right arrow Articles by YANG, M. C. K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

MISCELLANEA

Optimal allocation of observations for partitioning a set of new items into two control groups

JONATHAN J. SHUSTER and MARK C. K. YANG

Department of Statistics, University of Florida Gainesville

Samples of size n are drawn from each of two normal populations with different means and common variance. A third sample of size m is drawn from one of the former populations. In order to decide which population the third sample came from, we employ a maximum likelihood classification procedure, and determine, for fixed total number of measurements, the sample sizes n and m that nearly minimize the probability of misclassification. We also consider the case where several samples of size m are drawn, and each is to be classified into one of the two original normal populations.

Key Words: Classification • Discrimination • Optimal allocation


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.