arXiv:2411.06374cs.IRcs.LG2024-11被引 17

用度量学习解决推荐系统冷启动和数据稀疏问题。

Metric Learning for Tag Recommendation: Tackling Data Sparsity and Cold Start Issues

  • 基于度量学习构建用户与物品的相似性度量
  • 在前几项推荐中准确率显著优于基线方法
  • 适合处理新用户/新物品的冷启动场景

随着数字信息的快速增长,个性化推荐系统已成为互联网服务不可或缺的一部分,尤其在电子商务、社交媒体和在线娱乐领域。然而,传统协同过滤和基于内容的推荐方法在面对大规模异构数据时,难以应对数据稀疏性和冷启动问题,影响用户体验。本文提出一种基于度量学习的新标签推荐算法,通过学习有效的距离或相似性度量,捕捉用户偏好与物品特征间的细微差异,以克服传统推荐系统的局限性。实验结果表明,该算法在多个评估指标上优于局部响应度量学习(LRML)、协同度量学习(CML)以及基于对抗学习的自适应张量分解(ATF)等基线方法,尤其在前几项推荐的准确性上表现突出,同时具备良好的鲁棒性和高推荐精度。

原文摘要 · Abstract (English)

With the rapid growth of digital information, personalized recommendation systems have become an indispensable part of Internet services, especially in the fields of e-commerce, social media, and online entertainment. However, traditional collaborative filtering and content-based recommendation methods have limitations in dealing with data sparsity and cold start problems, especially in the face of largescale heterogeneous data, which makes it difficult to meet user expectations. This paper proposes a new label recommendation algorithm based on metric learning, which aims to overcome the challenges of traditional recommendation systems by learning effective distance or similarity metrics to capture the subtle differences between user preferences and item features. Experimental results show that the algorithm outperforms baseline methods including local response metric learning (LRML), collaborative metric learning (CML), and adaptive tensor factorization (ATF) based on adversarial learning on multiple evaluation metrics. In particular, it performs particularly well in the accuracy of the first few recommended items, while maintaining high robustness and maintaining high recommendation accuracy.

推荐系统度量学习冷启动

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。