01 Present PDF
01 Present PDF
01 Present PDF
()
0/27
Course Introduction
1/27
Course Introduction
1/27
Course Introduction
2/27
Course Introduction
2/27
Course Introduction
2/27
Course Introduction
2/27
Course Introduction
2/27
Course Introduction
2/27
Course Introduction
Course History
NTU Version
15-17 weeks (2+ hours)
highly-praised with English
3/27
Course Introduction
Course History
NTU Version
15-17 weeks (2+ hours)
highly-praised with English
Coursera Version
8 weeks of foundation (this
course) + 7 weeks of
techniques (coming course)
Mandarin teaching to reach
3/27
Course Introduction
Course History
NTU Version
15-17 weeks (2+ hours)
Coursera Version
8 weeks of foundation (this
course) + 7 weeks of
techniques (coming course)
3/27
Course Introduction
Fun Time
Which of the following description of this course is true?
1
the course will tell me the techniques that create the android
Lieutenant Commander Data in Star Trek
4/27
Course Introduction
Fun Time
Which of the following description of this course is true?
1
the course will tell me the techniques that create the android
Lieutenant Commander Data in Star Trek
Reference Answer: 4
1
4/27
Course Introduction
Roadmap
1
5/27
6/27
learning
skill
6/27
learning
skill
ML
skill
6/27
learning
skill
ML
skill
What is skill?
6/27
7/27
data
ML
improved
performance
measure
7/27
data
ML
improved
performance
measure
ML
7/27
data
ML
improved
performance
measure
ML
7/27
8/27
8/27
8/27
8/27
8/27
navigating on Mars
9/27
navigating on Mars
when human cannot define the solution easily
speech/visual recognition
9/27
navigating on Mars
when human cannot define the solution easily
speech/visual recognition
when needing rapid decisions that humans cannot do
high-frequency trading
9/27
navigating on Mars
when human cannot define the solution easily
speech/visual recognition
when needing rapid decisions that humans cannot do
high-frequency trading
when needing to be user-oriented in a massive scale
consumer-targeted marketing
9/27
navigating on Mars
when human cannot define the solution easily
speech/visual recognition
when needing rapid decisions that humans cannot do
high-frequency trading
when needing to be user-oriented in a massive scale
consumer-targeted marketing
Give a computer a fish, you feed it for a day;
teach it how to fish, you feed it for a lifetime. :-)
Hsuan-Tien Lin (NTU CSIE)
9/27
data
ML
improved
performance
measure
10/27
data
ML
improved
performance
measure
10/27
data
improved
performance
measure
ML
10/27
data
improved
performance
measure
ML
10/27
data
improved
performance
measure
ML
10/27
Fun Time
Which of the following is best suited for machine learning?
1
11/27
Fun Time
Which of the following is best suited for machine learning?
1
Reference Answer: 3
1
no pattern
programmable definition
11/27
ML
skill
12/27
ML
skill
12/27
ML
skill
12/27
ML
skill
12/27
data
1
skill
ML is everywhere!
Hsuan-Tien Lin (NTU CSIE)
12/27
Education
data
ML
skill
13/27
Education
data
ML
skill
A Possible ML Solution
answer correctly Jrecent strength of student > difficulty of questionK
13/27
Education
data
ML
skill
A Possible ML Solution
answer correctly Jrecent strength of student > difficulty of questionK
give ML 9 million records from 3000 students
13/27
Education
data
ML
skill
A Possible ML Solution
answer correctly Jrecent strength of student > difficulty of questionK
give ML 9 million records from 3000 students
automatically
13/27
Education
data
ML
skill
A Possible ML Solution
answer correctly Jrecent strength of student > difficulty of questionK
give ML 9 million records from 3000 students
automatically
key part of the world-champion system from
National Taiwan Univ. in KDDCup 2010
Hsuan-Tien Lin (NTU CSIE)
13/27
ML
skill
14/27
ML
skill
A Hot Problem
competition held by Netflix in 2006
100,480,507 ratings that 480,189 users gave to 17,770 movies
10% improvement = 1 million dollar prize
14/27
ML
skill
A Hot Problem
competition held by Netflix in 2006
100,480,507 ratings that 480,189 users gave to 17,770 movies
10% improvement = 1 million dollar prize
similar competition (movies songs) held by Yahoo! in KDDCup
2011
252,800,275 ratings that 1,000,990 users gave to 624,961 songs
14/27
ML
skill
A Hot Problem
competition held by Netflix in 2006
100,480,507 ratings that 480,189 users gave to 17,770 movies
10% improvement = 1 million dollar prize
similar competition (movies songs) held by Yahoo! in KDDCup
2011
252,800,275 ratings that 1,000,990 users gave to 624,961 songs
14/27
te r
s?
e
lik
om
sT
u
Cr
ise
A Possible ML Solution
pattern:
viewer
Match movie and
viewer factors
add contributions
from each factor
predicted
rating
movie
m
To
u
Cr
ise
in
it?
r?
s te
bu nt
ck nte
blo n co tent
tio on
ac d y c
me
co
15/27
te r
s?
e
lik
om
sT
u
Cr
ise
A Possible ML Solution
pattern:
viewer
learning:
Match movie and
viewer factors
add contributions
from each factor
predicted
rating
movie
m
To
u
Cr
ise
in
it?
r?
s te
bu nt
ck nte
blo n co tent
tio on
ac d y c
me
co
known rating
learned factors
unknown rating prediction
15/27
te r
s?
e
lik
om
sT
u
Cr
ise
A Possible ML Solution
pattern:
viewer
learning:
Match movie and
viewer factors
add contributions
from each factor
predicted
rating
movie
known rating
learned factors
unknown rating prediction
m
To
u
Cr
ise
in
it?
r?
s te
bu nt
ck nte
blo n co tent
tio on
ac d y c
me
co
15/27
Fun Time
Which of the following field cannot use machine learning?
1
Finance
Medicine
Law
16/27
Fun Time
Which of the following field cannot use machine learning?
1
Finance
Medicine
Law
Reference Answer: 4
1
16/27
Components of Learning:
Metaphor Using Credit Approval
Applicant Information
age
gender
annual salary
year in residence
year in job
current debt
23 years
female
NTD 1,000,000
1 year
0.5 year
200,000
17/27
Components of Learning:
Metaphor Using Credit Approval
Applicant Information
age
gender
annual salary
year in residence
year in job
current debt
23 years
female
NTD 1,000,000
1 year
0.5 year
200,000
17/27
18/27
18/27
18/27
18/27
{(xn , yn )} from f
ML
18/27
training examples
D : (x1 , y1 ), , (xN , yN )
(historical records in bank)
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
19/27
training examples
D : (x1 , y1 ), , (xN , yN )
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
target f unknown
19/27
training examples
D : (x1 , y1 ), , (xN , yN )
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
target f unknown
19/27
training examples
D : (x1 , y1 ), , (xN , yN )
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
target f unknown
19/27
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
20/27
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
20/27
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
20/27
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
20/27
training examples
D : (x1 , y1 ), , (xN , yN )
learning
algorithm
A
final hypothesis
gf
(learned formula to be used)
machine learning:
use data to compute hypothesis g
that approximates target f
Hsuan-Tien Lin (NTU CSIE)
21/27
Fun Time
How to use the four sets below to form a learning problem for
song recommendation?
S1 = [0, 100]
S2 = all possible (userid, songid) pairs
S3 = all formula that multiplies user factors & song factors,
indexed by all possible combinations of such factors
S4 = 1,000,000 pairs of ((userid, songid), rating)
1
S1 = X , S2 = Y, S3 = H, S4 = D
S1 = Y, S2 = X , S3 = H, S4 = D
S1 = D, S2 = H, S3 = Y, S4 = X
S1 = X , S2 = D, S3 = Y, S4 = H
22/27
Fun Time
How to use the four sets below to form a learning problem for
song recommendation?
S1 = [0, 100]
S2 = all possible (userid, songid) pairs
S3 = all formula that multiplies user factors & song factors,
indexed by all possible combinations of such factors
S4 = 1,000,000 pairs of ((userid, songid), rating)
1
S1 = X , S2 = Y, S3 = H, S4 = D
S1 = Y, S2 = X , S3 = H, S4 = D
S1 = D, S2 = H, S3 = Y, S4 = X
S1 = X , S2 = D, S3 = Y, S4 = H
Reference Answer: 2
A on S
3
(g : S2 S1 )
S4
Hsuan-Tien Lin (NTU CSIE)
22/27
Data Mining
23/27
Data Mining
target
23/27
Data Mining
target
ML = DM (usually what KDDCup does)
23/27
Data Mining
target
ML = DM (usually what KDDCup does)
if interesting property related to hypothesis that approximate
target
23/27
Data Mining
target
ML = DM (usually what KDDCup does)
if interesting property related to hypothesis that approximate
target
DM can help ML, and vice versa (often, but not always)
23/27
Data Mining
target
ML = DM (usually what KDDCup does)
if interesting property related to hypothesis that approximate
target
DM can help ML, and vice versa (often, but not always)
traditional DM also focuses on efficient computation in large
database
23/27
Data Mining
target
ML = DM (usually what KDDCup does)
if interesting property related to hypothesis that approximate
target
DM can help ML, and vice versa (often, but not always)
traditional DM also focuses on efficient computation in large
database
difficult to distinguish ML and DM in reality
Hsuan-Tien Lin (NTU CSIE)
23/27
Artificial Intelligence
compute something
that shows intelligent behavior
24/27
Artificial Intelligence
compute something
that shows intelligent behavior
24/27
Artificial Intelligence
compute something
that shows intelligent behavior
24/27
Artificial Intelligence
compute something
that shows intelligent behavior
24/27
Artificial Intelligence
compute something
that shows intelligent behavior
24/27
Statistics
25/27
Statistics
25/27
Statistics
25/27
Statistics
25/27
Statistics
25/27
Fun Time
Which of the following claim is not totally true?
1
26/27
Fun Time
Which of the following claim is not totally true?
1
Reference Answer: 3
While data mining and machine learning do
share a huge overlap, they are arguably not
equivalent because of the difference of focus.
26/27
Summary
1
27/27