![[SOLVED] CS PowerPoint Presentation](https://assignmentchef.com/wp-content/uploads/2022/08/downloadzip.jpg)
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 bs solution to problem a
b
a
a
b
Blue
Black
Red
Orange
Purple
Block World
Blue
Orange
Purple
Black
Green
Red
Green
WidthWidth
Height
?
What color is this block?
?
Blue
Black
Red
Orange
Purple
Green
WidthWidth
Height
?
Blue
Black
Red
Orange
Purple
Green
WidthWidth
Height
Blue
Black
Red
Orange
Purple
Green
?
WidthWidth
Height
?
What color is this block?
Width = 0.8
Height = 0.8
Blue
Black
Red
Orange
Purple
Green
WidthWidth
Height
?
What color is this block?
?
Blue
Black
Red
Orange
Purple
Green
WidthWidth
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
012345678910
012345678910
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination
y01348816888327
y79842919821101
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination
y01348816888327
y79842919821101
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination
y01348816888327
y79842919821101
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination
y01348816888327
y79842919821101
A
B
C
D
E
F
Q
A
B
C
D
E
F
Q
Routes by Origin
Routes by Destination
y01348816888327
y79842919821101
Assignment
How would you use recording cases to design an agent that could answer Ravens Progressive Matrices?
To recap
Recording and using cases
Nearest neighbor method
Cases in real-world problems
Nearest neighbor in k-dimensional problems
Block
Blue0.52.00.80.81.24
Red0.50.50.80.80.42
Black1.01.50.80.80.72
Green1.51.50.80.80.98
Orange1.50.50.80.80.76
Purple2.01.00.80.81.22
Finding the Nearest Neighbor
Given existing case at (
and new problem at (
Block
Blue0.52.01.11.60.72
Red0.50.51.11.61.25
Black1.01.51.11.60.14
Green1.51.51.11.60.41
Orange1.50.51.11.61.17
Purple2.01.01.11.61.08
Block
Blue0.52.01.11.60.72
Red0.50.51.11.61.25
Black1.01.51.11.60.14
Green1.51.51.11.60.41
Orange1.50.51.11.61.17
Purple2.01.01.11.61.08
OriginDestination
Route
A061.417910.00
B181.009810.63
C382.24827.07
D483.16413.00
E838.06211.00
F828.60908.06
Q1711
Route
A067910.10
B189810.68
C38827.42
D48414.36
E83218.12
F829011.80
Q1711
OriginDestination
Route
A061.417910.00
B181.009810.63
C382.24827.07
D483.16413.00
E838.06211.00
F828.60908.06
Q1711
Finding the Nearest Neighbor
Given existing case at (
and new problem at (
Given existing case at (
and new problem at (
/docProps/thumbnail.jpeg
Reviews
There are no reviews yet.