On subset selection from logistic populations
نویسندگان
چکیده
منابع مشابه
Subset Selection Based on Order Statistics from Logistic Populations
Consider k equal size treatment groups and let the outcome of interest be a survival time. Suppose that a known monotone transformation of the survival times is logistically distributed and that the treatment only affects the location parameter. We obtain exact results for the problem of selecting a subset of treatments, based on the i-th ordered survival times, which contains with specified pr...
متن کاملFeature subset selection for logistic regression via mixed integer optimization
This paper concerns a method of selecting a subset of features for a logistic regression model. Information criteria, such as the Akaike information criterion and Bayesian information criterion, are employed as a goodness-offit measure. The feature subset selection problem is formulated as a mixed integer linear optimization problem, which can be solved with standard mathematical optimization s...
متن کاملRemainder Subset Awareness for Feature Subset Selection
Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. It is of the greatest importance to take the most of every evaluation of the inducer, which is normally the more costly part. In this paper, a technique is proposed that takes into account the inducer evaluation both in the ...
متن کامل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...
متن کاملOn the general position subset selection problem
Let f(n, l) be the maximum integer such that every set of n points in the plane with at most l collinear contains a subset of f(n, l) points with no three collinear. First we prove that if l 6 O( √ n) then f(n, l) > Ω( √ n ln l ). Second we prove that if l 6 O(n) then f(n, l) > Ω( √ n logl n), which implies all previously known lower bounds on f(n, l) and improves them when l is not fixed. A mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistica Neerlandica
سال: 1992
ISSN: 0039-0402,1467-9574
DOI: 10.1111/j.1467-9574.1992.tb01334.x