Tangent Distance Procedure

Tangent Distance Procedure

• Given data { xi } and classes { cJ }
  • Each xi is an element of some class cJ
• Classify a new data point n:

• This is Nearest Neighbor

Previous slide

Next slide

Back to the first slide

View Graphic Version