论文标题
使用分散矩阵分解的隐私保留点率建议
Privacy Preserving Point-of-interest Recommendation Using Decentralized Matrix Factorization
论文作者
论文摘要
由于基于位置的网络(例如Foursquare和Yelp)的普及,最近引起了人们的关注点(POI)建议。在现有的POI推荐方法中,基于矩阵分解(MF)的技术已被证明是有效的。但是,现有的MF方法遇到了两个主要问题:(1)由于集中式的模型培训机制而导致的昂贵计算和存储:集中的学习者必须维持整个用户项目评级矩阵,以及潜在的巨大低级矩阵。 (2)隐私问题:用户的偏好有可能通过集中学习者泄露恶意攻击者。为了解决这些问题,我们为POI推荐提供了一个分散的MF(DMF)框架。具体来说,我们建议使用随机步行的分散培训技术来训练每个用户的端子,例如手机和垫子,而不是维护所有低级矩阵和敏感评级数据,而是提出了一种基于步行的分散培训技术。通过这样做,每个用户的评分仍然保持自己的手,而且可以将分散的学习作为分布式学习与多学习者(用户)一起进行,从而减轻了计算和存储问题。两个现实世界数据集的实验结果表明,与经典和最先进的潜在因子模型相比,DMF从精确和回忆方面显着改善了建议性能。
Points of interest (POI) recommendation has been drawn much attention recently due to the increasing popularity of location-based networks, e.g., Foursquare and Yelp. Among the existing approaches to POI recommendation, Matrix Factorization (MF) based techniques have proven to be effective. However, existing MF approaches suffer from two major problems: (1) Expensive computations and storages due to the centralized model training mechanism: the centralized learners have to maintain the whole user-item rating matrix, and potentially huge low rank matrices. (2) Privacy issues: the users' preferences are at risk of leaking to malicious attackers via the centralized learner. To solve these, we present a Decentralized MF (DMF) framework for POI recommendation. Specifically, instead of maintaining all the low rank matrices and sensitive rating data for training, we propose a random walk based decentralized training technique to train MF models on each user's end, e.g., cell phone and Pad. By doing so, the ratings of each user are still kept on one's own hand, and moreover, decentralized learning can be taken as distributed learning with multi-learners (users), and thus alleviates the computation and storage issue. Experimental results on two real-world datasets demonstrate that, comparing with the classic and state-of-the-art latent factor models, DMF significantly improvements the recommendation performance in terms of precision and recall.