<--- Back to Details
First PageDocument Content
Information science / Information retrieval / Hashing / Countmin sketch / Recommender system / MinHash / K-nearest neighbors algorithm / Feature hashing / Cryptographic hash function / Collaborative filtering
Date: 2016-08-17 10:09:29
Information science
Information retrieval
Hashing
Countmin sketch
Recommender system
MinHash
K-nearest neighbors algorithm
Feature hashing
Cryptographic hash function
Collaborative filtering

POIsketch: Semantic Place Labeling over User Activity Streams 1 Dingqi Yang1 , Bin Li2 , Philippe Cudr´e-Mauroux1 eXascale Infolab, University of Fribourg, 1700 Fribourg, Switzerland 2

Add to Reading List

Source URL: exascale.info

Download Document from Source Website

File Size: 540,32 KB

Share Document on Facebook

Similar Documents

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity Martin Albrecht1 , Lorenzo Grassi3 , Christian Rechberger2,3 , Arnab Roy2 , and Tyge Tiessen2 1

DocID: 1xUN2 - View Document

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

Introduction to Locality-Sensitive Hashing Tyler NeylonFormats: html | pdf | kindle pdf] Locality-sensitive hashing (LSH) is a set of techniques that

DocID: 1xTR9 - View Document

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

Proceedings: Equality and Hashing for (Almost) Free: Generating Implementations from Abstraction Functions

DocID: 1xTdH - View Document