Description Usage Arguments Value Author(s) References Examples
select
employs the Approximate Best Subset Maximum Binary Prediction Rule
(PRESCIENCE) on the given variable selection problem.
1 2 |
formula |
an object of class formula of the format: (binary dependent variable) ~ (normalized focus variable) + (remaining focus variables) + (auxiliary variables). |
data |
a data frame containing the variables in the model. |
nfoc |
integer. The number of focus variable(s) excluding the intercept. |
q |
integer. The cardinality constraint for the covariate selection. |
bound |
numeric. The maximum absolute value of the bounds for all variables. |
beta0 |
integer. The coefficient taking value either 1 or -1 to normalize the scale for the first focus variable. |
tol |
numeric. Tolerance level. If |
warmstart |
logical. If |
tau |
the tuning parameter for enlarging the estimated bounds. |
mio |
integer. 1 for MIO method 1 and 2 for method 2 in the paper. |
tlim |
time limit (in seconds) specified for the MIO solver. |
a list with 7 elements:
tolerance |
tolerance level |
status |
optimization status |
score |
Gurobi score |
gap |
the MIO optimization gap value in case of early termination (0 if optimal solution is found within the time limit) |
rtime |
time used by the MIO solver in the estimation procedure |
ncount |
the number of Branch-and-bound nodes |
bhat |
maximum score estimates for coefficients |
Yankang (Bennie) Chen <yankang.chen@columbia.edu>
Best Subset Binary Prediction by Le-Yu Chen and Sokbae Lee (2018). https://arxiv.org/abs/1610.02738
1 2 3 4 5 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.