Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
4Activity
0 of .
Results for:
No results containing your search query
P. 1
decision trees

decision trees

Ratings: (0)|Views: 88|Likes:
Published by phli
formulas and examples for implementing decision tree learning algorithms
formulas and examples for implementing decision tree learning algorithms

More info:

Published by: phli on Aug 29, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

06/18/2010

pdf

text

original

 
Decision Trees
USC LinguisticsJuly 26, 2007
Suppose we wish to classify events according to their temporal orientations.
1
-ed -s will be [sing] t(e)He read. F F F F T t(e)
<
STHe was hungry. F F F T T t(e)
<
STHe ran. F F F F T t(e)
<
STThey liked it. T F F F F t(e)
<
STHe reads. F T F F T t(e)
STHe is happy. F F F T T t(e)
STThey need it. T F F F F t(e)
STThey want it. F F F F F t(e)
STHe will read. F F T F T t(e)
>
STThey will get it. F F T F F t(e)
>
ST
(
(
v
1
)
,...,P 
(
v
n
)) =
n
i
=1
(
v
i
)
log
2
(
v
i
) (1)
(410
,
410
,
210) =
.
5288 +
.
5288 +
.
4644 = 1
.
522 (2)
Remainder
(
A
) =
i
c
(
A
i
)
c
(
v
1
)
c
(
A
i
)
,...,c
(
v
n
)
c
(
A
i
)
(3)
Gain
(
A
) =
(
(
v
1
)
,...,P 
(
v
n
))
Remainder
(
A
) (4)
R
(
ed
) =210
(12
,
12
,
0) +810
(38
,
38
,
28) =
.
2
1 +
.
8
1
.
56 = 1
.
45 (5)
R
(
s
) =110
(0
,
1
,
0) +910
(49
,
39
,
29) =
.
1
0 +
.
9
1
.
53 = 1
.
38 (6)
1
Notice immediately, that there is no way to disambiguate the written representation “They read”;unless, perhaps, the past is more likely to be eventive, and more likely to want a direct object.
1
 
R
(
will
) =210
(0
,
0
,
1) +810
(48
,
48
,
0) =
.
2
0 +
.
8
1 =
.
8 (7)
R
(
be
) =210
(12
,
12
,
0) +810
(38
,
38
,
28) =
.
2
1 +
.
8
1
.
56 = 1
.
45 (8)
R
([
sing
]) =610
(36
,
26
,
16) +410
(14
,
24
,
14) =
.
6
1
.
45 +
.
4
1
.
5 = 1
.
475 (9)
<<<<
∩ ∩ ∩∩
>>
will:T
>>
will:F
<<<<
∩ ∩ ∩∩
(48
,
48) = 1 (10)
R
(
ed
) =28
(12
,
12) +68
(36
,
36) =
.
25 +
.
75 = 1 (11)
R
(
s
) =18
(0
,
1) +78
(47
,
37) = 0 +
.
86 =
.
86 (12)
R
(
be
) =28
(12
,
12) +68
(36
,
36) =
.
25 +
.
75 = 1 (13)
R
([
sing
]) =58
(35
,
25) +38
(13
,
23) =
.
61 +
.
34 =
.
95 (14)
<<<<
∩ ∩ ∩∩
>>
will:T
>>
will:F
<<<<
∩ ∩ ∩∩
-s:T
-s:F
<<<<
2
 
-ed -s w-1 [sing] t(e)He read. F F - T t(e)
<
STHe was hungry. F F was T t(e)
<
STHe ran. F F - T t(e)
<
STThey liked it T F - F t(e)
<
STHe reads. F T - T t(e)
STHe is happy F F is T t(e)
STThey need it. T F - F t(e)
STThey want it. F F - F t(e)
STHe will read. F F will T t(e)
>
STThey will get it. F F will F t(e)
>
ST
R
(
w
1) =610
(36
,
36
,
0) +110
(1
,
0
,
0) +110
(0
,
1
,
0) +210
(0
,
0
,
1) =
.
6 (15)
<<<<
∩ ∩ ∩∩
>>
w-1:-
<<<
w-1:was
<
w-1:is
w-1:will
>>
-ed -s w-1 [sing] t(e)He read. F F he T t(e)
<
STHe was hungry. F F was T t(e)
<
STHe ran. F F he T t(e)
<
STThey liked it T F they F t(e)
<
STHe reads. F T he T t(e)
STHe is happy F F is T t(e)
STThey need it. T F they F t(e)
STThey want it. F F they F t(e)
STHe will read. F F will T t(e)
>
STThey will get it. F F will F t(e)
>
ST
R
(
w
1) =310
(23
,
13
,
0) +110
(1
,
0
,
0) +310
(13
,
23
,
0) +110
(0
,
1
,
0) +210
(0
,
0
,
1) (16)
R
(
w
1) =
.
55 (17)3

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->