Class: ClassificationDiscriminant
Classification error by resubstitution
L = resubLoss(obj)
L = resubLoss(obj,Name,Value)
returns
the resubstitution loss, meaning the loss computed for the data that L
= resubLoss(obj
)fitcdiscr
used to create obj
.
returns
loss statistics with additional options specified by one or more L
= resubLoss(obj
,Name,Value
)Name,Value
pair
arguments.
|
Discriminant analysis classifier, produced using |
Specify optional
comma-separated pairs of Name,Value
arguments. Name
is
the argument name and Value
is the corresponding value.
Name
must appear inside quotes. You can specify several name and value
pair arguments in any order as
Name1,Value1,...,NameN,ValueN
.
'LossFun'
— Loss function'classiferror'
(default) | 'binodeviance'
| 'exponential'
| 'hinge'
| 'logit'
| 'mincost'
| 'quadratic'
| function handleLoss function, specified as the comma-separated pair consisting
of 'LossFun'
and a built-in, loss-function name
or function handle.
The following table lists the available loss functions. Specify one using the corresponding character vector or string scalar.
Value | Description |
---|---|
'binodeviance' | Binomial deviance |
'classiferror' | Classification error |
'exponential' | Exponential |
'hinge' | Hinge |
'logit' | Logistic |
'mincost' | Minimal expected misclassification cost (for classification scores that are posterior probabilities) |
'quadratic' | Quadratic |
'mincost'
is appropriate for
classification scores that are posterior probabilities.
Discriminant analysis models return posterior probabilities
as classification scores by default (see predict
).
Specify your own function using function handle notation.
Suppose that n
be the number of observations
in X
and K
be the number of
distinct classes (numel(obj.ClassNames)
). Your
function must have this signature
lossvalue = lossfun
(C,S,W,Cost)
The output argument lossvalue
is
a scalar.
You choose the function name (lossfun
).
C
is an n
-by-K
logical
matrix with rows indicating which class the corresponding observation
belongs. The column order corresponds to the class order in obj.ClassNames
.
Construct C
by setting C(p,q) =
1
if observation p
is in class q
,
for each row. Set all other elements of row p
to 0
.
S
is an n
-by-K
numeric
matrix of classification scores. The column order corresponds to the
class order in obj.ClassNames
. S
is
a matrix of classification scores, similar to the output of predict
.
W
is an n
-by-1
numeric vector of observation weights. If you pass W
,
the software normalizes them to sum to 1
.
Cost
is a K-by-K
numeric
matrix of misclassification costs. For example, Cost = ones(K)
- eye(K)
specifies a cost of 0
for correct
classification, and 1
for misclassification.
Specify your function using 'LossFun',@
.lossfun
For more details on loss functions, see Classification Loss.
Data Types: char
| string
| function_handle
|
Classification error, a scalar. The meaning of the error depends
on the values in |
Compute the resubstituted classification error for the Fisher iris data:
load fisheriris obj = fitcdiscr(meas,species); L = resubLoss(obj) L = 0.0200
Classification loss functions measure the predictive inaccuracy of classification models. When you compare the same type of loss among many models, a lower loss indicates a better predictive model.
Consider the following scenario.
L is the weighted average classification loss.
n is the sample size.
For binary classification:
yj is the observed class label. The software codes it as –1 or 1, indicating the negative or positive class, respectively.
f(Xj) is the raw classification score for observation (row) j of the predictor data X.
mj = yjf(Xj) is the classification score for classifying observation j into the class corresponding to yj. Positive values of mj indicate correct classification and do not contribute much to the average loss. Negative values of mj indicate incorrect classification and contribute significantly to the average loss.
For algorithms that support multiclass classification (that is, K ≥ 3):
yj*
is a vector of K – 1 zeros, with 1 in the
position corresponding to the true, observed class
yj. For example,
if the true class of the second observation is the third class and
K = 4, then
y*2
= [0 0 1 0]′. The order of the classes corresponds to the order in
the ClassNames
property of the input
model.
f(Xj)
is the length K vector of class scores for
observation j of the predictor data
X. The order of the scores corresponds to the
order of the classes in the ClassNames
property
of the input model.
mj = yj*′f(Xj). Therefore, mj is the scalar classification score that the model predicts for the true, observed class.
The weight for observation j is wj. The software normalizes the observation weights so that they sum to the corresponding prior class probability. The software also normalizes the prior probabilities so they sum to 1. Therefore,
Given this scenario, the following table describes the supported loss
functions that you can specify by using the 'LossFun'
name-value pair
argument.
Loss Function | Value of LossFun | Equation |
---|---|---|
Binomial deviance | 'binodeviance' | |
Exponential loss | 'exponential' | |
Classification error | 'classiferror' | It is the weighted fraction of misclassified observations where is the class label corresponding to the class with the maximal posterior probability. I{x} is the indicator function. |
Hinge loss | 'hinge' | |
Logit loss | 'logit' | |
Minimal cost | 'mincost' | Minimal cost. The software computes the weighted minimal cost using this procedure for observations j = 1,...,n.
The weighted, average, minimum cost loss is |
Quadratic loss | 'quadratic' |
This figure compares the loss functions (except 'mincost'
) for one
observation over m. Some functions are normalized to pass through [0,1].
The posterior probability that a point z belongs to class j is the product of the prior probability and the multivariate normal density. The density function of the multivariate normal with mean μj and covariance Σj at a point z is
where is the determinant of Σk, and is the inverse matrix.
Let P(k) represent the prior probability of class k. Then the posterior probability that an observation x is of class k is
where P(x) is a normalization constant, the sum over k of P(x|k)P(k).
The prior probability is one of three choices:
'uniform'
— The prior probability
of class k
is one over the total number of classes.
'empirical'
— The prior
probability of class k
is the number of training
samples of class k
divided by the total number
of training samples.
Custom — The prior probability of class k
is
the k
th element of the prior
vector.
See fitcdiscr
.
After creating a classification model (Mdl
)
you can set the prior using dot notation:
Mdl.Prior = v;
where v
is a vector of positive elements
representing the frequency with which each element occurs. You do
not need to retrain the classifier when you set a new prior.
The matrix of expected costs per observation is defined in Cost.
You clicked a link that corresponds to this MATLAB command:
Run the command by entering it in the MATLAB Command Window. Web browsers do not support MATLAB commands.
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.