Description Usage Arguments Details Value References See Also Examples
A local version of Linear Discriminant Analysis that puts increased emphasis on a good model fit near the decision boundary.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | dalda(x, ...)
## S3 method for class 'formula'
dalda(formula, data, weights = rep(1, nrow(data)), ...,
subset, na.action)
## S3 method for class 'data.frame'
dalda(x, ...)
## S3 method for class 'matrix'
dalda(x, grouping, weights = rep(1, nrow(x)), ..., subset,
na.action = na.fail)
## Default S3 method:
dalda(x, grouping, wf = c("biweight", "cauchy", "cosine",
"epanechnikov", "exponential", "gaussian", "optcosine", "rectangular",
"triangular"), bw, k, nn.only, itr = 3, weights, ...)
|
x |
(Required if no |
formula |
A formula of the form |
data |
A |
weights |
Initial observation weights (defaults to a vector of 1s). |
subset |
An index vector specifying the cases to be used in the training sample. (NOTE: If given, this argument must be named.) |
na.action |
A function to specify the action to be taken if NAs are found. The default action is first
the |
grouping |
(Required if no |
wf |
A window function which is used to calculate weights that are introduced into
the fitting process. Either a character string or a function, e.g. |
bw |
(Required only if |
k |
(Required only if |
nn.only |
(Required only if |
itr |
Number of iterations for model fitting, defaults to 3. See also the Details section. |
... |
Further arguments to be passed to |
The idea of Hand and Vinciotti (2003) to put increased weight on observations near the
decision boundary is generalized to the multiclass case and applied to Linear Discriminant
Analysis (LDA).
Since the decision boundary is not known in advance an iterative procedure is required.
First, an unweighted LDA is fitted to the data.
Based on the differences between the two largest estimated posterior probabilities observation
weights are calculated.
Then a weighted LDA (see wlda
) is fitted using these weights.
Calculation of weights and model fitting is done several times in turn.
The number of iterations is determined by the itr
-argument that defaults to 3.
The name of the window function (wf
) can be specified as a character string.
In this case the window function is generated internally in dalda
. Currently
supported are "biweight"
, "cauchy"
, "cosine"
, "epanechnikov"
,
"exponential"
, "gaussian"
, "optcosine"
, "rectangular"
and
"triangular"
.
Moreover, it is possible to generate the window functions mentioned above in advance
(see wfs
) and pass them to dalda
.
Any other function implementing a window function can also be used as wf
argument.
This allows the user to try own window functions.
See help on wfs
for details.
If the predictor variables include factors, the formula interface must be used in order to get a correct model matrix.
An object of class "dalda"
inheriting from "wlda"
, a list
containing the following components:
prior |
Weighted class prior probabilities. |
counts |
The number of observations per class. |
means |
Weighted estimates of class means. |
cov |
Weighted estimate of the pooled class covariance matrix. |
lev |
The class labels (the levels of |
N |
The number of training observations. |
weights |
A list of length |
method |
The method used for scaling the pooled weighted covariance matrix. |
itr |
The number of iterations used. |
wf |
The window function used. Always a function, even if the input was a string. |
bw |
(Only if |
k |
(Only if |
nn.only |
(Logical. Only if |
adaptive |
(Logical.) |
call |
The (matched) function call. |
Hand, D. J., Vinciotti, V. (2003), Local versus global models for classification problems: Fitting models where it matters, The American Statistician, 57(2) 124–130.
predict.dalda
, wlda
for a weighted version of Linear Discriminant Analysis and dalr
for discriminant adaptive logistic regression.
1 2 3 4 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.