【论文笔记10】A unified framework of ATL for cross-system recommendation 跨系统推荐的一种主动迁移学习框加, AI 2017

本文提出了一种使用主动学习原则构建跨系统实体对应关系的推荐系统算法,旨在解决数据稀疏性问题。通过迭代选择目标系统中的实体并查询其在源系统中的对应关系,最大化知识转移,提高推荐质量。研究包括三种具体解决方案:最大边距矩阵分解、正则化低秩矩阵分解和概率矩阵分解。
摘要由CSDN通过智能技术生成

系列传送

我的论文笔记频道

【Active Learning】
【论文笔记01】Learning Loss for Active Learning, CVPR 2019
【论文笔记02】Active Learning For Convolutional Neural Networks: A Core-Set Approch, ICLR 2018
【论文笔记03】Variational Adversarial Active Learning, ICCV 2019
【论文笔记04】Ranked Batch-Mode Active Learning,ICCV 2016

【Transfer Learning】
【论文笔记05】Active Transfer Learning, IEEE T CIRC SYST VID 2020
【论文笔记06】Domain-Adversarial Training of Neural Networks, JMLR 2016
【论文笔记10】A unified framework of active transfer learning for cross-system recommendation, AI 2017

【Differential Privacy】
【论文笔记07】A Survey on Differentially Private Machine Learning, IEEE CIM 2020
【论文笔记09】Differentially Private Hypothesis Transfer Learning, ECML&PKDD 2018
【论文笔记11】 Deep Domain Adaptation With Differential Privay, IEEE TIFS 2020

【Model inversion attack】
【论文笔记08】Model inversion attacks that exploit confidence information and basic countermeasures, SIGSAC 2015

A unified framework of active transfer learning for cross-system recommendation

原文传送

1 Abstract

基于协同过滤的推荐系统算法在理想的数据情况下表现不错 (collaborative-filtering-based recommendation system),但由于现实中 data sparsity issue (little existing rating information is available) 而表现不佳。

为了解决这个问题,可以把迁移学习应用过来,以往的 transfer learning models for recommender systems often assume that a sufficient set of entity correspondences (either user or item) across the target and auxiliary systems is given in advance. 往更一般的情况考虑,这点也很难成立,因为现实中 entity correspondences across systems are usually unknown, and the cost of identifying them can be expensive.

这篇文章提出了基于主动迁移学习的推荐系统算法,using an active learning principle to construct entity correspondences across systems. [也就是说选择最有价值的来弄entity correspondences] Specifically, for the purpose of maximizing knowledge transfer, the paper first iteratively select entities (either users or items) in the target system based on some criterion to query their correspondences in the sour

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值