A Restricted Subset Selection Approach to Ranking and Selection Problems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Likelihood Ratio Procedures for Subset Selection and Ranking Problems

This report deals with procedures for random-size subset selection from k(> 2) given populations where the distribution of ir^(i = l, ..., k) has a density f^(x;0^). Let ••• -®[k] denote unknown values of the parameters, and let ^[i]» ***'ïï[k] denote the corresponding populations. First, we have considered the problem of selection for consider the /s procedure that selects TT. if sup L(0;x) > ...

متن کامل

A Ranking Approach to Genomic Selection

BACKGROUND Genomic selection (GS) is a recent selective breeding method which uses predictive models based on whole-genome molecular markers. Until now, existing studies formulated GS as the problem of modeling an individual's breeding value for a particular trait of interest, i.e., as a regression problem. To assess predictive accuracy of the model, the Pearson correlation between observed and...

متن کامل

Axiomatic approach to feature subset selection basedon

In this paper an axiomatic characterisation of feature subset selection is presented. Two axioms are presented: suuciency axiom | preservation of learning information, and necessity axiom | minimising encoding length. The suuciency axiom concerns the existing dataset and is derived based on the following understanding: any selected feature subset should be able to describe the training dataset ...

متن کامل

On Lagrangian Relaxation and Subset Selection Problems

We prove a general result demonstrating the power of Lagrangian relaxation in solving constrained maximization problems with arbitrary objective functions. This yields a unified approach for solving a wide class of subset selection problems with linear constraints. Given a problem in this class and some small ε ∈ (0, 1), we show that if there exists a ρ-approximation algorithm for the Lagrangia...

متن کامل

A Multiple Attribute Utility Theory Approach to Ranking and Selection

John Butler • Douglas J. Morrice • Peter W. Mullarkey Center for Information Technology Management, and Department of Accounting and MIS, The Ohio State University, Columbus, Ohio 43210 Department of Management Science and Information Systems, CBA 5.202, The University of Texas at Austin, Austin, Texas 78712-1175 Maxager Technology, Inc., 2173 E. Francisco Boulevard, Suite C, San Rafael, Califo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 1975

ISSN: 0090-5364

DOI: 10.1214/aos/1176343060