Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    Chapter 2. Classifiers Based On Bayes Decision Theory

    Uploaded by

    Charan Priyatham
    Bayes Decision Theory

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Chapter 2. Classifiers Based On Bayes Decision Theory

    Uploaded by

    Charan Priyatham
    24 views1 page
    Bayes Decision Theory

    Original Title

    Bayes Decision Theory

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Bayes Decision Theory

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    24 views1 page

    Chapter 2. Classifiers Based On Bayes Decision Theory

    Uploaded by

    Charan Priyatham
    Bayes Decision Theory

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Chapter 2.

    Classifiers Based on Bayes


    Decision Theory

    2.1. INTRODUCTION
    This is the first chapter, out of three, dealing with the design of the classifier in a
    pattern recognition system. The approach to be followed builds upon
    probabilistic arguments stemming from the statistical nature of the generated
    features. As has already been pointed out in the introductory chapter, this is due
    to the statistical variation of the patterns as well as to the noise in the measuring
    sensors. Adopting this reasoning as our kickoff point, we will design classifiers
    that classify an unknown pattern in the most probable of the classes. Thus, our
    task now becomes that of defining what “most probable” means.
    1 2 M
    Given a classification task of M classes, ω , ω ,…, ω , and an unknown pattern,
    which is represented
    i by a feature vector x, we form the M conditional
    probabilities P(ω |x), i = 1, 2,…, M. Sometimes, these are also referred to as a
    posteriori probabilities. In words, each of them represents
    i the probability that the
    unknown pattern belongs to the respective class ω , given that the corresponding
    feature vector takes the value x. Who could then argue that these conditional
    probabilities are not sensible choices to quantify the term most probable? Indeed,
    the classifiers to be considered in this chapter compute either the maximum of
    these M values or, equivalently, the maximum of an appropriately defined
    function of them. The unknown pattern is then assigned to the class
    corresponding to this maximum.

    The first task we are faced with is the computation of the conditional
    probabilities. The Bayes rule will once more prove its usefulness! A major effort
    in this chapter will be devoted to techniques for estimating probability density
    functions (pdf), based on the available experimental evidence, that is, the feature
    vectors corresponding to the patterns of the training set.

    Recommended / Playlists / History / Topics / Tutorials / Settings / Get the App / Sign Out
    © 2018 Safari. Terms of Service / Privacy Policy
    PREV NEXT
    ⏮ ⏭
    Chapter 1. Introduction Pattern Recognition

    You might also like