Lecture 25. InstanceBased Learning (IBL): k Nearest Neighbor and Radial Basis Functions. Tuesday, November 20, 2001 William H. Hsu Department of Computing and Information Sciences, KSU http://www.cis.ksu.edu/~bhsu Readings: Chapter 8, Mitchell. Lecture Outline.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
InstanceBased Learning (IBL):
kNearest Neighbor and Radial Basis Functions
Tuesday, November 20, 2001
William H. Hsu
Department of Computing and Information Sciences, KSU
http://www.cis.ksu.edu/~bhsu
Readings:
Chapter 8, Mitchell
InstanceBased Learning (IBL)
When to Consider Nearest Neighbor
+
Training Data:
Labeled Instances


Delaunay
Triangulation


?
+
Voronoi
(Nearest Neighbor)
Diagram
+

+
Query Instance
xq

Voronoi Diagram
kNN and Bayesian Learning:Behavior in the Limit
DistanceWeighted kNN
Locally Weighted Regression
…
1
…
an(x)
a1(x)
a2(x)
Radial Basis Function (RBF) Networks
RBF Networks: Training
CaseBased Reasoningin CADET
Q1
+
Q1, T1
Q3
Q2
+
T1
Q3, T3
+
T = temperature
Q = water flow
T3
T2
+
Q2, T2
+
Ct
Qc
+

+
+
+
Cf
Qh
Qm
+
+
+
Tc
Tm
+
Th
CADET:Example
Structure
Function
CADET:Properties