No label defined (Q4725538)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3999032
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3999032

      Statements

      0 references
      1985
      0 references
      robustness of classification schemes
      0 references
      plug-in rule
      0 references
      asymptotic behaviour of estimators
      0 references
      risk function
      0 references
      Discussed is a problem of robustness of classification schemes formulated in the following way. Patterns coming from classes \(\omega_ 1,\omega_ 2,...,\omega_ c\) are viewed as elements of N-dimensional Euclidean space governed by probability density functions \(p_ i(x,\vartheta_ i)\), \(i=1,2,...,c\), with unknown parameters \(\vartheta_ i\). These parameters are estimated by means of plug-in rule (viz. on a basis of a sample of patterns \(A_ 1,A_ 2,...,A_ c\), \(card(A_ i)=n_ i\) coming from each class and chosen at random). In the problem discussed it is assumed that \(A_ 1,A_ 2,...,A_ c\) are noisy in the sense that \(A_ i\), \(i=1,2,...,c\) contains not only patterns of the i-th class itself but \(\epsilon_ i100 \%\) of patterns coming from the remaining classes. Two theorems are proved that describe the asymptotic behaviour of estimators of \(\vartheta_ i\) and a risk function with respect to small parameters \((\epsilon_ i,n_ i^{-1/2})\). Moreover a measure of robustness of classification rules is introduced and considered with respect to the above parameters.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references