Adaptive mixtures: Recursive nonparametric pattern recognition

https://doi.org/10.1016/0031-3203(91)90145-UGet rights and content

Abstract

We develop a method of performing pattern recognition (discrimination and classification) using a recursive technique derived from mixture models, kernel estimation and stochastic approximation.

References (19)

  • D.M. Titterington et al.

    Statistical Analysis of Finite Mixture Distributions

    (1985)
  • R.A. Tapia et al.

    Nonparametric Probability Density Estimation

    (1978)
  • B.L.S. Prakasa Rao

    Nonparametric Functional Estimation

    (1983)
  • M.B. Nevel'son et al.

    Stochastic Approximation and Recursive Estimation

  • T.Y. Young et al.

    Classification, Estimation and Pattern Recognition

    (1974)
  • M.A. Aizerman et al.

    The probability problem of pattern recognition learning and the method of potential functions

    Automn remote Control

    (1966)
  • I.J. Good et al.

    Nonparametric roughness penalties for probability densities

    Biometrika

    (1971)
  • K. Fukunaga et al.

    The reduced parzen classifier

    IEEE Trans. Pattern Anal. Mach. Intell.

    (1989)
  • M.G. Kendall

    Discrimination and classification

There are more references available in the full text version of this article.

Cited by (31)

  • Rectification of plant measurements using a statistical framework

    2005, Computers and Chemical Engineering
    Citation Excerpt :

    It also describes the statistical characteristics, e.g. correlation among process variables and the distribution properties of these variables. To enhance the estimation of p(x), the method of adaptive mixtures (Priebe & Marchette, 1991) is used. This method broadens the estimation process resulting from the standard off-line training of p(x) and improves it with on-line updating of p(x).

  • Multidimensional Density Estimation

    2005, Handbook of Statistics
    Citation Excerpt :

    Other sophisticated procedures for choosing the number of components in mixture models have also been explored. For example, Priebe and Marchette (1991, 1993) and Priebe (1994) discuss what the authors' refer to as “adaptive mixtures” that incorporate the ideas behind both kernel estimators and mixture models and that use a data-based method for adding new terms to a mixture. The adaptive mixture approach can at times overfit data and Solka et al. (1998) combine adaptive mixtures with a pruning step to yield more parsimonious models.

  • Reducing bias in curve estimation by use of weights

    1999, Computational Statistics and Data Analysis
View all citing articles on Scopus
View full text