• DocumentCode
    2732210
  • Title

    OBE set estimates in classification problems

  • Author

    Joachim, D. ; Deller, J.R. ; Mandour, Jr G I

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Michigan State Univ., East Lansing, MI, USA
  • fYear
    1998
  • fDate
    9-12 Aug 1998
  • Firstpage
    259
  • Lastpage
    262
  • Abstract
    This paper explores the use of alternative estimates arising from the feasibility set of an optimal bounded ellipsoid (OBE) algorithm. The central estimator is interpretable as a least squares result, but all others in the bounding set are consistent with the observations and error bounds as well. The purpose of the present paper is to focus attention on the set estimates in an effort to stimulate further research into their utility in applications. As an example, we suggest the use of set estimates in classification problems in which the classes can be represented by distinct linear-in-parameters models, or by related sets
  • Keywords
    least squares approximations; parameter estimation; signal classification; OBE set estimates; bounding set; feasibility set; least squares result; linear-in-parameters models; optimal bounded ellipsoid algorithm; signal classification problems; Ellipsoids; Laboratories; Least squares approximation; Recursive estimation; Resonance light scattering; Speech processing; State estimation; Statistics; Technological innovation; Uncertainty;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1998. Proceedings. 1998 Midwest Symposium on
  • Conference_Location
    Notre Dame, IN
  • Print_ISBN
    0-8186-8914-5
  • Type

    conf

  • DOI
    10.1109/MWSCAS.1998.759482
  • Filename
    759482