返回
Semi-discrete Matrix Factorization
DOI:10.1109/MIS.2020.3016944.png)
摘要
En 中文
Discrete matrix factorization (DMF) has been a promising solution to improve the inferring efficiency of matrix factorization (MF) against the rapidly growing numbers of users and items. However, DMF suffers from a serious encoding loss due to its oversimplified modeling on the original data geometry. In this article, we propose a semi-discrete matrix factorization (SDMF) model to combine the predicting efficacy of MF with the inferring efficiency of DMF. It first learns real-valued latent features by MF, and then, taking them as group-wise and point-wise smoothness, learns binary codes in the DMF framework, for preserving the geometrical structures collectively hidden in users and items, as well as aligning binary codes originated from Hamming space with their real-valued counterparts learned from vector space. Particularly, we devise a computationally efficient optimization algorithm to estimate model parameters. Extensive evaluations on three real-world datasets clearly demonstrate the superiority of our SDMF model over state-of-the-art hash-based recommendation methods.
Keyword:
Binary codes
Optimization
Computational modeling
Recommender systems
Quantization (signal)
Intelligent systems
Geometry
Data models
Computational efficiency
Recommender Systems
Matrix Factorization
Learning to Hash
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.1
论文数:
1.6K
被引数:
4.5K
机构
引用论文
Rottlerin exhibits antitumor activity via down-regulation of TAZ in non-small cell lung cancer
Oncotarget
IF0
A review of the state-of-the-art of wireless SHM systems and an experimental set-up towards an improved design
Eurocon 2013
IF0

