CS代考计算机代写 PowerPoint Presentation

PowerPoint Presentation

Learning by Recording Cases

Learning by Recording Cases
Incremental Concept Learning
Version Spaces
Classification
Learning

Learning by Recording Cases
Case-Based Reasoning
Analogical Reasoning
Explanation-Based Learning
Analogical Reasoning

Lesson Preview

Learning by recording cases

Nearest neighbor method

Cases in the real world

k-Nearest Neighbor

Block World
Blue
Orange
Purple
Black
Green
Red

?
What color is this block?

Block World
Blue
Orange
Purple
Black
Green
Red

?
What color is this block?
Black
Block World
Blue
Orange
Purple
Black
Green
Red

Given new problem a

Retrieve most similar prior problem, b, from memory

Apply b’s solution to problem a

b
a
a
b

Blue
Black
Red
Orange
Purple
Block World
Blue
Orange
Purple
Black
Green
Red
Green

Width Width
Height

?
What color is this block?

?

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

?

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

Blue
Black
Red
Orange
Purple
Green
?

Width Width
Height

?
What color is this block?
Width = 0.8
Height = 0.8

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

?
What color is this block?

?

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

A
B
C
D
E
F

A
B
C
D
E
F
Q
What route is most similar to this new problem?
ο
ο
ο
ο
ο
ο

A
B
C
D
E
F
Q
0 1 2 3 4 5 6 7 8 9 10
0 1 2 3 4 5 6 7 8 9 10
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

Assignment

How would you use recording cases to design an agent that could answer Raven’s Progressive Matrices?

To recap…

Recording and using cases

Nearest neighbor method

Cases in real-world problems

Nearest neighbor in k-dimensional problems

Block
Blue 0.5 2.0 0.8 0.8 1.24
Red 0.5 0.5 0.8 0.8 0.42
Black 1.0 1.5 0.8 0.8 0.72
Green 1.5 1.5 0.8 0.8 0.98
Orange 1.5 0.5 0.8 0.8 0.76
Purple 2.0 1.0 0.8 0.8 1.22

Finding the Nearest Neighbor

Given existing case at (
and new problem at (

Block
Blue 0.5 2.0 1.1 1.6 0.72
Red 0.5 0.5 1.1 1.6 1.25
Black 1.0 1.5 1.1 1.6 0.14
Green 1.5 1.5 1.1 1.6 0.41
Orange 1.5 0.5 1.1 1.6 1.17
Purple 2.0 1.0 1.1 1.6 1.08

Block
Blue 0.5 2.0 1.1 1.6 0.72
Red 0.5 0.5 1.1 1.6 1.25
Black 1.0 1.5 1.1 1.6 0.14
Green 1.5 1.5 1.1 1.6 0.41
Orange 1.5 0.5 1.1 1.6 1.17
Purple 2.0 1.0 1.1 1.6 1.08

Origin Destination
Route
A 0 6 1.41 7 9 10.00
B 1 8 1.00 9 8 10.63
C 3 8 2.24 8 2 7.07
D 4 8 3.16 4 1 3.00
E 8 3 8.06 2 1 1.00
F 8 2 8.60 9 0 8.06
Q 1 7 – 1 1 –

Route
A 0 6 7 9 10.10
B 1 8 9 8 10.68
C 3 8 8 2 7.42
D 4 8 4 1 4.36
E 8 3 2 1 8.12
F 8 2 9 0 11.80
Q 1 7 1 1 –

Origin Destination
Route
A 0 6 1.41 7 9 10.00
B 1 8 1.00 9 8 10.63
C 3 8 2.24 8 2 7.07
D 4 8 3.16 4 1 3.00
E 8 3 8.06 2 1 1.00
F 8 2 8.60 9 0 8.06
Q 1 7 – 1 1 –

Finding the Nearest Neighbor

Given existing case at (
and new problem at (

Given existing case at (
and new problem at (

/docProps/thumbnail.jpeg

Posted in Uncategorized

CS代考计算机代写 PowerPoint Presentation

PowerPoint Presentation

Learning by Recording Cases

Learning by Recording Cases
Incremental Concept Learning
Version Spaces
Classification
Learning

Learning by Recording Cases
Case-Based Reasoning
Analogical Reasoning
Explanation-Based Learning
Analogical Reasoning

Lesson Preview

Learning by recording cases

Nearest neighbor method

Cases in the real world

k-Nearest Neighbor

Block World
Blue
Orange
Purple
Black
Green
Red

?
What color is this block?

Block World
Blue
Orange
Purple
Black
Green
Red

?
What color is this block?
Black
Block World
Blue
Orange
Purple
Black
Green
Red

Given new problem a

Retrieve most similar prior problem, b, from memory

Apply b’s solution to problem a

b
a
a
b

Blue
Black
Red
Orange
Purple
Block World
Blue
Orange
Purple
Black
Green
Red
Green

Width Width
Height

?
What color is this block?

?

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

?

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

Blue
Black
Red
Orange
Purple
Green
?

Width Width
Height

?
What color is this block?
Width = 0.8
Height = 0.8

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

?
What color is this block?

?

Blue
Black
Red
Orange
Purple
Green

Width Width
Height

A
B
C
D
E
F

A
B
C
D
E
F
Q
What route is most similar to this new problem?
ο
ο
ο
ο
ο
ο

A
B
C
D
E
F
Q
0 1 2 3 4 5 6 7 8 9 10
0 1 2 3 4 5 6 7 8 9 10
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination

y 0 1 3 4 8 8 1 6 8 8 8 3 2 7

y 7 9 8 4 2 9 1 9 8 2 1 1 0 1

Assignment

How would you use recording cases to design an agent that could answer Raven’s Progressive Matrices?

To recap…

Recording and using cases

Nearest neighbor method

Cases in real-world problems

Nearest neighbor in k-dimensional problems

Block
Blue 0.5 2.0 0.8 0.8 1.24
Red 0.5 0.5 0.8 0.8 0.42
Black 1.0 1.5 0.8 0.8 0.72
Green 1.5 1.5 0.8 0.8 0.98
Orange 1.5 0.5 0.8 0.8 0.76
Purple 2.0 1.0 0.8 0.8 1.22

Finding the Nearest Neighbor

Given existing case at (
and new problem at (

Block
Blue 0.5 2.0 1.1 1.6 0.72
Red 0.5 0.5 1.1 1.6 1.25
Black 1.0 1.5 1.1 1.6 0.14
Green 1.5 1.5 1.1 1.6 0.41
Orange 1.5 0.5 1.1 1.6 1.17
Purple 2.0 1.0 1.1 1.6 1.08

Block
Blue 0.5 2.0 1.1 1.6 0.72
Red 0.5 0.5 1.1 1.6 1.25
Black 1.0 1.5 1.1 1.6 0.14
Green 1.5 1.5 1.1 1.6 0.41
Orange 1.5 0.5 1.1 1.6 1.17
Purple 2.0 1.0 1.1 1.6 1.08

Origin Destination
Route
A 0 6 1.41 7 9 10.00
B 1 8 1.00 9 8 10.63
C 3 8 2.24 8 2 7.07
D 4 8 3.16 4 1 3.00
E 8 3 8.06 2 1 1.00
F 8 2 8.60 9 0 8.06
Q 1 7 – 1 1 –

Route
A 0 6 7 9 10.10
B 1 8 9 8 10.68
C 3 8 8 2 7.42
D 4 8 4 1 4.36
E 8 3 2 1 8.12
F 8 2 9 0 11.80
Q 1 7 1 1 –

Origin Destination
Route
A 0 6 1.41 7 9 10.00
B 1 8 1.00 9 8 10.63
C 3 8 2.24 8 2 7.07
D 4 8 3.16 4 1 3.00
E 8 3 8.06 2 1 1.00
F 8 2 8.60 9 0 8.06
Q 1 7 – 1 1 –

Finding the Nearest Neighbor

Given existing case at (
and new problem at (

Given existing case at (
and new problem at (

/docProps/thumbnail.jpeg

Posted in Uncategorized