Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Nearest-Neighbor Learning Algorithm

  • Learning is just storing the representations of the training examples in D.

  • Testing instance x (under 1NN):

    • Compute similarity between x and all examples in D.

    • Assign x the category of the most similar example in D.

  • Does not explicitly compute a generalization or category prototypes.

  • Also called:

    • Case-based learning

    • Memory-based learning

    • Lazy learning

  • Rationale of kNN: contiguity hypothesis

Speaker notes:

Content Tools


There are currently no sources for this slide.