DOC PREVIEW
UT Dallas CS 6375 - hw0

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:

CS 6375 Homework 0 Due: 01/21/2015, 2:30pm. Total: 100 points. 1. [15 pts] Describe an application that you think machine learning approaches are appropriate (maybe machine learning is already used or you think that can be used). Explain the task clearly and how machine learning is or can be used. Please try to find an application that is not discussed in the textbook or our class. 2. [10 pts] Assume you are going to build a system to detect spam emails, that is, your task is to determine whether an email is legitimate or spam. What kind of attributes/features would you use for this task? 3. [75 pts] The following problems are meant to help you refresh your memory on some concepts related to math and statistics, which we will need in this course. 3.1. Probability and statistics a) [5 pts] What is the probability of getting exactly 8 heads when flipping a fair coin 10 times? b) [5 pts] For a fair coin, when you toss it 10 times, which of the following sequence is more likely to occur? HHHHHHHHHH or HTHTHHTTHT c) [5 pts] If you don’t know whether a coin is fair or biased (towards head or tail), when you see the sequences above from another person’s tossing, what can say about whether the coin is likely to be fair or biased? d) [5 pts] Assume P(A)=0.4 and P(B)=0.25, what is the maximum and minimum possible value of P(AIB) and P(AUB)? e) [5 pts] Compare P(A|B) and P(A), is the former greater or less than, or equal to the latter? f) [5 pts] What is the probability density function for Gaussian distribution? g) [5 pts] Let random variable X be the outcome of a roll of a six-sided die (a fair one, therefore all six sides are equally likely). What is the expectation of X? 3.2. Linear algebra a) [5 pts] =312a =241b what is the dot product of them (i.e., baT)? b) [15 pts] Consider dRx∈ and some dRu ∈ with 1=u. What is the maximum value of xuT? minimum value of xuT? minimum value of || xuT? 3.3. Calculus a) [5 pts] Let xxeexf+=1)( , what is dxxdf )(? b) [5 pts] Let 22)3ln(),(xyxeyeyxf ++=, what is yyxf∂∂),(? c) [10 pts] Assume a>0, b>0, find xxxbeae2min−+.How to submit your homework? • Please either submit the electronic version of your homework via eLearning, or submit the hard copy in class. • Please write your answers clearly. • Please remember to write down your


View Full Document

UT Dallas CS 6375 - hw0

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

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 hw0
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 hw0 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 hw0 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?