Stochastically robust personalized ranking for LSH recommendation retrieval
Locality Sensitive Hashing (LSH) has become one of the most commonly used approximate nearest neighbor search techniques to avoid the prohibitive cost of scanning through all data points. For recommender systems, LSH achieves efficient recommendation retrieval by encoding user and item vectors into...
Saved in:
Main Authors: | LE, Dung D., LAUW, Hady W. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5123 https://ink.library.smu.edu.sg/context/sis_research/article/6127/viewcontent/5889_Article_Text_9114_1_10_20200513.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Adversarial Personalized Ranking for Recommendation
by: Xiangnan He, et al.
Published: (2020) -
Scalable content-based music retrieval using chord progression histogram and tree-structure LSH
by: Yu, Y., et al.
Published: (2014) -
Indexable Bayesian personalized ranking for efficient top-k recommendation
by: LE, Dung D., et al.
Published: (2017) -
Building deep networks on grassmann manifolds
by: HUANG, Zhiwu, et al.
Published: (2018) -
Dynamic topic models for temporal document networks
by: ZHANG, Ce, et al.
Published: (2022)