<--- 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

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

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

DocID: 1roz3 - View Document

Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams Anshumali Shrivastava Arnd Christian König

Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams Anshumali Shrivastava Arnd Christian König

DocID: 1pPus - View Document

CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch Tim Roughgarden & Gregory Valiant∗ March 30, 2016

CS168: The Modern Algorithmic Toolbox Lecture #2: Approximate Heavy Hitters and the Count-Min Sketch Tim Roughgarden & Gregory Valiant∗ March 30, 2016

DocID: 1oysX - View Document

Efficient Private Statistics with Succinct Sketches Luca Melis, George Danezis, and Emiliano De Cristofaro Department of Computer Science, University College London {luca.melis.14, g.danezis, e.decristofaro}@ucl.ac.uk Ab

Efficient Private Statistics with Succinct Sketches Luca Melis, George Danezis, and Emiliano De Cristofaro Department of Computer Science, University College London {luca.melis.14, g.danezis, e.decristofaro}@ucl.ac.uk Ab

DocID: 1m7fn - View Document

New Estimation Algorithms for Streaming Data: Count-min Can Do More Fan Deng University of Alberta   Davood Rafiei

New Estimation Algorithms for Streaming Data: Count-min Can Do More Fan Deng University of Alberta Davood Rafiei

DocID: 1kg4q - View Document