1 / 19

Parameter Estimation using likelihood functions Tutorial #1

Parameter Estimation using likelihood functions Tutorial #1. This class has been cut and slightly edited from Nir Friedman’s full course of 12 lectures which is available at www.cs.huji.ac.il/~pmai . Changes made by Dan Geiger and Ydo Wexler. Example: Binomial Experiment.

dolf
Download Presentation

Parameter Estimation using likelihood functions Tutorial #1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. .

  2. Parameter Estimation using likelihood functionsTutorial #1 This class has been cut and slightly edited from Nir Friedman’s full course of 12 lectures which is available at www.cs.huji.ac.il/~pmai. Changes made by Dan Geiger and Ydo Wexler. .

  3. Example: Binomial Experiment • When tossed, it can land in one of two positions: Head or Tail Head Tail • We denote by  the (unknown) probability P(H). Estimation task: • Given a sequence of toss samples x[1], x[2], …, x[M] we want to estimate the probabilities P(H)=  and P(T) = 1 - 

  4. i.i.d. samples Statistical Parameter Fitting • Consider instances x[1], x[2], …, x[M] such that • The set of values that x can take is known • Each is sampled from the same distribution • Each sampled independently of the rest • The task is to find a vector of parameters  that have generated the given data. This vector parameter  can be used to predict future data.

  5. L()  0 0.2 0.4 0.6 0.8 1 The Likelihood Function • How good is a particular ?It depends on how likely it is to generate the observed data • The likelihood for the sequence H,T, T, H, H is

  6. Sufficient Statistics • To compute the likelihood in the thumbtack example we only require NH and NT (the number of heads and the number of tails) • NH and NT are sufficient statistics for the binomial distribution

  7. Formally, s(D) is a sufficient statistics if for any two datasets D and D’ • s(D) = s(D’ ) LD() = LD’ () Datasets Statistics Sufficient Statistics • A sufficient statistic is a function of the data that summarizes the relevant information for the likelihood

  8. Maximum Likelihood Estimation MLE Principle: Choose parameters that maximize the likelihood function • This is one of the most commonly used estimators in statistics • Intuitively appealing • One usually maximizes the log-likelihood function defined as lD() = logeLD()

  9. L() 0 0.2 0.4 0.6 0.8 1 (Which coincides with what one would expect) Example: (NH,NT ) = (3,2) MLE estimate is 3/5 = 0.6 Example: MLE in Binomial Data • Applying the MLE principle we get

  10. Sufficient statistics: • N1, N2, …, NK - the number of times each outcome is observed Likelihood function: MLE: From Binomial to Multinomial • For example, suppose X can have the values 1,2,…,K (For example a die has 6 sides) • We want to learn the parameters 1, 2. …, K

  11. MLE: Example: Multinomial • Let be a protein sequence • We want to learn the parameters q1, q2,…,q20 corresponding to the frequencies of the 20 amino acids • N1, N2, …, N20 - the number of times each amino acid is observed in the sequence Likelihood function:

  12. Is MLE all we need? • Suppose that after 10 observations, • ML estimates P(H) = 0.7 for the thumbtack • Would you bet on heads for the next toss? • Suppose now that after 10 observations, • ML estimates P(H) = 0.7 for a coin • Would you place the same bet? • Solution: The Bayesian approach which incorporates your subjective prior knowledge. E.g., you may know a priori that some amino acids have the same frequencies and some have low frequencies. How would one use this information ?

  13. Bayes’ rule Bayes’ rule: Where It hold because:

  14. What is the probability the die is loaded? Example: Dishonest Casino • A casino uses 2 kind of dice: 99% are fair 1% is loaded: 6 comes up 50% of the times • We pick a die at random and roll it 3 times • We get 3 consecutive sixes

  15. Dishonest Casino (cont.) The solution is based on using Bayes rule and the fact that while P(loaded | 3sixes) is not known, the other three terms in Bayes rule are known, namely: • P(3sixes | loaded)=(0.5)3 • P(loaded)=0.01 • P(3sixes) = P(3sixes | loaded)P(loaded)+P(3sixes | not loaded) (1-P(loaded))

  16. Dishonest Casino (cont.)

  17. p(ai|int) - the frequency of amino acid ai for intracellular proteins p(ai|ext) - the frequency of amino acid ai for extracellular proteins Biological Example: Proteins • Extracellular proteins have a slightly different amino acid composition than intracellular proteins. • From a large enough protein database (SWISS-PROT), we can get the following: p(int) - the probability that any new sequence is intracellular p(ext) - the probability that any new sequence is extracellular

  18. Biological Example: Proteins (cont.) • What is the probability that a given new protein sequence x=x1x2….xn is extracellular? • Assuming that every sequence is either extracellular or intracellular (but not both) we can write . • Thus,

  19. By Bayes’ theorem Biological Example: Proteins (cont.) • Using conditional probability we get , • The probabilities p(int), p(ext) are called the priorprobabilities. • The probability P(ext|x) is called the posterior probability.

More Related