Description Usage Arguments Value Author(s) Examples
Computes a decreasing lambda sequence of length d
.
The sequence ranges from a data determined maximal lambda λ_\textrm{max} to the user inputed lambda.min
.
1 2 3 4 5 |
x |
design matrix, matrix of size N \times p. |
classes |
classes, factor of length N. |
sampleWeights |
sample weights, a vector of length N. |
grouping |
grouping of features, a vector of length p. Each element of the vector specifying the group of the covariate. |
groupWeights |
the group weights, a vector of length m+1 (the number of groups).
The first element of the vector is the intercept weight.
If √{K\cdot\textrm{number of features in the group}} for all other weights. |
parameterWeights |
a matrix of size K \times (p+1). The first column of the matrix is the intercept weights. Default weights are is 0 for the intercept weights and 1 for all other weights. |
alpha |
the α value 0 for group lasso, 1 for lasso, between 0 and 1 gives a sparse group lasso penalty. |
d |
the length of lambda sequence |
standardize |
if TRUE the features are standardize before fitting the model. The model parameters are returned in the original scale. |
lambda.min |
the smallest lambda value in the computed sequence. |
intercept |
should the model include intercept parameters |
sparse.data |
if TRUE |
lambda.min.rel |
is lambda.min relative to lambda.max ? (i.e. actual lambda min used is |
algorithm.config |
the algorithm configuration to be used. |
a vector of length d
containing the computed lambda sequence.
Martin Vincent
1 2 3 4 5 6 7 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.