Mining of Massive Datasets Jure Leskovec Stanford Univ.

First Page		Document Content
Date: 2014-05-30 14:36:21 Information retrieval Search algorithms Parallel computing MinHash MapReduce Jaccard index Nearest neighbor search Locality-sensitive hashing Collaborative filtering Information science Science Computing		Mining of Massive Datasets Jure Leskovec Stanford Univ. Add to Reading List Source URL: infolab.stanford.edu Download Document from Source Website File Size: 2,91 MB Share Document on Facebook

	Distributed Computing Prof. R. Wattenhofer BA/MA/SA/Group: Nearest Neighbor Search in Ultrametric Spaces DocID: 1tUny - View Document
	1 Product quantization for nearest neighbor search Herv´e J´egou, Matthijs Douze, Cordelia Schmid Abstract— This paper introduces a product quantization DocID: 1tzgx - View Document
	Multi-View Complementary Hash Tables for Nearest Neighbor Search Xianglong Liu† Lei Huang† Cheng Deng‡ Jiwen Lu ♮ Bo Lang† DocID: 1ttOD - View Document
	Locally Optimized Product Quantization for Approximate Nearest Neighbor Search Yannis Kalantidis and Yannis Avrithis National Technical University of Athens {ykalant, iavr}@image.ntua.gr DocID: 1tt48 - View Document
	Song Intersection by Approximate Nearest Neighbor Search Michael Casey Malcolm Slaney Goldsmiths College DocID: 1tkRr - View Document