skip to main | skip to sidebar

COMS 4771

Machine Learning (Spring 2008), Columbia University

Wednesday, April 2, 2008

Nearest Neighbor Methods

Dimensionality reduction:
Isomap
Locally Linear Embedding (LLE)
Maximum variance unfolding

Distance Metric Learning for Large Margin
Nearest Neighbor Classification


Nearest neighbor schemes:
Piotr Indyk's tutorial
Ken Clarkson's tutorial

Cover trees
Locality-Sensitive Hashing (LSH)
ANN: A Library for Approximate Nearest Neighbor Searching
Posted by COMS 4771 at 8:24 PM

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Blog Archive

  • ▼  2008 (11)
    • ▼  April (6)
      • Final
      • Reading Assignments
      • Questions about final projects
      • Nearest Neighbor Methods
      • Test set bound
      • Large Scale Learning
    • ►  March (3)
    • ►  February (2)
  • ►  2007 (1)
    • ►  December (1)