Average classification accuracy over collections of Gaussian problems - common covariance matrix case (Q793472)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Average classification accuracy over collections of Gaussian problems - common covariance matrix case
scientific article

    Statements

    Average classification accuracy over collections of Gaussian problems - common covariance matrix case (English)
    0 references
    0 references
    0 references
    1984
    0 references
    The mean probability of correct classification (\({\bar P}_{cr})\) is calculated over a collection of equiprobable two-class Gaussian problems with a common covariance matrix for each problem. The Bayes minimum error classification rule, in which the unbiased estimates of the mean vectors and covariance matrices are used in place of the true values, is the classification rule considered. The variation of \({\bar P}_{cr}\) with dimensionality N is investigated for three interesting cases with different complexities. In the first case all the parameters of the class-conditional densities are known. For the second case the common covariance matrix is assumed known and only the mean vectors need to be estimated, while all the parameters need to be estimated in the last case. For these three cases the relationship between \({\bar P}_{cr}\) and N is plotted for a specific collection of problems. For the case of finite sample size, peaking of \({\bar P}_{cr}\) with N is encountered in most of the cases considered.
    0 references
    0 references
    Mahalanobis distance
    0 references
    optimal dimensionality, unbiased estimates
    0 references
    multivariate Gaussian distributions
    0 references
    pattern classification
    0 references
    mean probability of correct classification
    0 references
    equiprobable two-class Gaussian problems
    0 references
    common covariance matrix
    0 references
    Bayes minimum error classification rule
    0 references
    0 references