Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Formulae Sheet: Markov Decision Processes

    Uploaded by

    speedzf
    This document provides formulae for key concepts in machine learning including Markov decision processes, neural networks, and decision trees. For Markov decision processes, it outlines the Bellman equations. For neural networks, it presents the perceptron learning rule and sigmoid activation function. For decision trees, it defines metrics like the Gini index, information gain, and gain ratio that are used for splitting nodes and reducing entropy during the tree construction process. It also includes a misclassification error formula and conversions between log base 2 and log base 10.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Formulae Sheet: Markov Decision Processes

    Uploaded by

    speedzf
    11 views1 page
    This document provides formulae for key concepts in machine learning including Markov decision processes, neural networks, and decision trees. For Markov decision processes, it outlines the Bellman equations. For neural networks, it presents the perceptron learning rule and sigmoid activation function. For decision trees, it defines metrics like the Gini index, information gain, and gain ratio that are used for splitting nodes and reducing entropy during the tree construction process. It also includes a misclassification error formula and conversions between log base 2 and log base 10.

    Original Description:

    AI

    Original Title

    Formula Sheet

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document provides formulae for key concepts in machine learning including Markov decision processes, neural networks, and decision trees. For Markov decision processes, it outlines the Bellman equations. For neural networks, it presents the perceptron learning rule and sigmoid activation function. For decision trees, it defines metrics like the Gini index, information gain, and gain ratio that are used for splitting nodes and reducing entropy during the tree construction process. It also includes a misclassification error formula and conversions between log base 2 and log base 10.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    11 views1 page

    Formulae Sheet: Markov Decision Processes

    Uploaded by

    speedzf
    This document provides formulae for key concepts in machine learning including Markov decision processes, neural networks, and decision trees. For Markov decision processes, it outlines the Bellman equations. For neural networks, it presents the perceptron learning rule and sigmoid activation function. For decision trees, it defines metrics like the Gini index, information gain, and gain ratio that are used for splitting nodes and reducing entropy during the tree construction process. It also includes a misclassification error formula and conversions between log base 2 and log base 10.

    Copyright:

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

    FormulaeSheet

    MarkovDecisionProcesses

    BellmanEquations: U (s) = R(s, (a)) + T (s, (a), s)U (s)


    s

    U (s) = maxaR(s, a) + T (s, a, s)U


    (s)
    s

    NeuralNetworks
    PerceptronLearningRule:
    new_wi=old_wi+wi
    where
    wi=(tkok)xik

    SigmoidActivationFunction: S(t) = 1+e1 t

    DecisionTrees

    GiniIndexforgivennode(t): GINI(t) = 1 [p(j|t)]2


    k

    SplittingbasedonGINI: GINI split = ni GINI(i)


    i=1

    Entropyatagivennode(t): Entropy(t) = p(j|t)logp(j|t)


    j

    InformationGain: GAIN split = Entropy(p) ( ni Entropy(i))


    i=1

    GainRatio:GainRAT IOsplit =

    GAIN split
    SplitINFO

    i=1

    Misclassificationerror: Error(t) = 1 maxiP (i|t)

    Convertingtologbase2:
    Ifyourcalculatordoesnothavethelog2function,hereshowtocalculate:

    log2a = loga
    log2

    Note:logaislog10aandlog2islog102

    OR

    SplitINF O = ni log ni

    log2a =

    lna
    ln2

    You might also like