Page1 15-853:Algorithms in the Real World Nearest Neighbors in High Dimensions - Curse of dimensionality - Representing Documents and Products as Sets, Set similarity - Minhash for compact set signatures - Locality sensitive hashing “BigData” 15-853 Curse of Dimensionality Previously we have learned about spatial decomposition methods such as kd-trees. Why do these fail with very high dimensions (
Algorithms in the "Real World" Course Versions Course Topics Lecture Notes Information on algorithms available on the web Companies that sell products that use various algorithms Course Versions Spring 2018 Fall 2015 Spring 2014 Spring 2013 Spring 2012 Fall 2010 Fall 2009 Fall 2008 Fall 2007 Fall 2006 Fall 2005 Fall 2004 Fall 2003 Spring 2003 (undergraduate version) Fall 2002 Fall 2001 Fall 2000 A
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く