DOC PREVIEW
UT Dallas CS 6375 - AdaBoostExample

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Example of AdaBoostingThe training data:index: 0 1 2 3 4 5 6 7 8 9x value: 0 1 2 3 4 5 6 7 8 9y value: 1 1 1 -1 -1 -1 1 1 1 -1The weak learner produces hypotheses of the form: x < v, or x > v. The threshold v isdetermined to minimize the probability of error over the entire data. (No sampling.)Running the algorithm.We start with the following probabilities:p0p1p2p3p4p5p6p7p8p90.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1t = 1. The best threshold is between 2 and 3.h1(x) = I(x < 2.5)1= 0.3α1= 0.423649qi= 1.52753 for wrong, 0.654654 for rightUpdating the probabilities:index: 0 1 2 3 4 5 6 7 8 9correct: y y y y y y n n n yold pi0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1 0.1pre-normalized pi.06547 .06547 .06547 .06547 .06547 .06547 .15 .15 .15 .06547Z1= 0.916515new pi.07143 .07143 .07143 .07143 .07143 .07143 .16667 .16667 .16667 .07143f1(x) = 0.423649 I(x < 2.5), 3 mistakest = 2. Now a threshold between 2 and 3 gives error of 0.5, the threshold between 5 and 6 gives0.28, the threshold between 8 and 9 gives 0.214, best.h2(x) = I(x < 8.5)2= 0.214α2= 0.6496Updating the probabilities:index: 0 1 2 3 4 5 6 7 8 9correct: y y y n n n y y y ypre-normalized pi.037 .037 .037 .137 .137 .137 .087 .087 .087 .037Z2= 0.82new pi.045 .045 .045 .167 .167 .167 .106 .106 .106 .045f2(x) = 0.423649 I(x < 2.5) + 0.6496 I(x < 8.5), 3 mistakest = 3. The best threshold is between 5 and 6.h3(x) = I(x > 5.5)3= 0.1818α3= 0.7520Updating the probabilities:index: 0 1 2 3 4 5 6 7 8 9correct: n n n y y y y y y npre-normalized pi.0964 .0964 .0964 .078 .078 .078 .05 .05 .05 .0964Z3= 0.77139new pi.125 .125 .125 .102 .102 .102 .064 .064 .064 .125f3(x) = 0.423649 I(x < 2.5) + 0.6496 I(x < 8.5) + 0.752 I(x > 5.5), 0


View Full Document

UT Dallas CS 6375 - AdaBoostExample

Documents in this Course
ensemble

ensemble

17 pages

em

em

17 pages

dtree

dtree

41 pages

cv

cv

9 pages

bayes

bayes

19 pages

vc

vc

24 pages

svm-2

svm-2

16 pages

svm-1

svm-1

18 pages

rl

rl

18 pages

mle

mle

16 pages

mdp

mdp

19 pages

knn

knn

11 pages

intro

intro

19 pages

hmm-train

hmm-train

26 pages

hmm

hmm

28 pages

hmm-train

hmm-train

26 pages

hmm

hmm

28 pages

ensemble

ensemble

17 pages

em

em

17 pages

dtree

dtree

41 pages

cv

cv

9 pages

bayes

bayes

19 pages

vc

vc

24 pages

svm-2

svm-2

16 pages

svm-1

svm-1

18 pages

rl

rl

18 pages

mle

mle

16 pages

mdp

mdp

19 pages

knn

knn

11 pages

intro

intro

19 pages

vc

vc

24 pages

svm-2

svm-2

16 pages

svm-1

svm-1

18 pages

rl

rl

18 pages

mle

mle

16 pages

mdp

mdp

19 pages

knn

knn

11 pages

intro

intro

19 pages

hmm-train

hmm-train

26 pages

hmm

hmm

28 pages

ensemble

ensemble

17 pages

em

em

17 pages

dtree

dtree

41 pages

cv

cv

9 pages

bayes

bayes

19 pages

vc

vc

24 pages

svm-2

svm-2

16 pages

svm-1

svm-1

18 pages

rl

rl

18 pages

mle

mle

16 pages

mdp

mdp

19 pages

knn

knn

11 pages

intro

intro

19 pages

hmm-train

hmm-train

26 pages

hmm

hmm

28 pages

ensemble

ensemble

17 pages

em

em

17 pages

dtree

dtree

41 pages

cv

cv

9 pages

bayes

bayes

19 pages

hw2

hw2

2 pages

hw1

hw1

4 pages

hw0

hw0

2 pages

hw5

hw5

2 pages

hw3

hw3

3 pages

20.mdp

20.mdp

19 pages

19.em

19.em

17 pages

16.svm-2

16.svm-2

16 pages

15.svm-1

15.svm-1

18 pages

14.vc

14.vc

24 pages

9.hmm

9.hmm

28 pages

5.mle

5.mle

16 pages

3.bayes

3.bayes

19 pages

2.dtree

2.dtree

41 pages

1.intro

1.intro

19 pages

21.rl

21.rl

18 pages

CNF-DNF

CNF-DNF

2 pages

ID3

ID3

4 pages

mlHw6

mlHw6

3 pages

MLHW3

MLHW3

4 pages

MLHW4

MLHW4

3 pages

ML-HW2

ML-HW2

3 pages

vcdimCMU

vcdimCMU

20 pages

hw0

hw0

2 pages

hw3

hw3

3 pages

hw2

hw2

2 pages

hw1

hw1

4 pages

9.hmm

9.hmm

28 pages

5.mle

5.mle

16 pages

3.bayes

3.bayes

19 pages

2.dtree

2.dtree

41 pages

1.intro

1.intro

19 pages

15.svm-1

15.svm-1

18 pages

14.vc

14.vc

24 pages

hw2

hw2

2 pages

hw1

hw1

4 pages

hw0

hw0

2 pages

hw3

hw3

3 pages

9.hmm

9.hmm

28 pages

5.mle

5.mle

16 pages

3.bayes

3.bayes

19 pages

2.dtree

2.dtree

41 pages

1.intro

1.intro

19 pages

Load more
Download AdaBoostExample
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view AdaBoostExample and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view AdaBoostExample 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?