用中性样本提升推荐系统,让无标签数据更有价值
Unlocking the Hidden Treasures: Enhancing Recommendations with Unlabeled Data
- 引入正-中-负三类样本学习用户复杂偏好
- 在4个真实数据集上显著提升多种推荐模型性能
- 适合研究推荐系统冷启动与无监督学习的学者
协同过滤(CF)是推荐系统的核心技术,但如何有效利用海量无标签数据仍是重大挑战。现有方法仅提取近似负样本,忽视了剩余数据的价值。为此,本文提出正-中-负(PNN)学习范式,引入‘中性’类别,包含难以直接判定为正或负的复杂项目。通过三元组部分排序训练模型,可更好建模用户复杂偏好。理论分析表明PNN与单向部分AUC(OPAUC)相关联。但实现存在两大难点:一是在缺乏监督信号时难以区分无标签数据的中性或负性;二是尚无损失函数能处理集合级三元组排序关系。为此,本文设计半监督学习方法与用户感知注意力模型,用于知识获取与分类优化,并提出基于双阶段中心点排序的新损失函数,以支持集合级排序。在四个真实数据集上的大量实验表明,结合PNN后,多种代表性CF模型性能均显著提升,即使使用简单矩阵分解,其效果也接近复杂的图中性网络。
原文摘要 · Abstract (English)
Collaborative filtering (CF) stands as a cornerstone in recommender systems, yet effectively leveraging the massive unlabeled data presents a significant challenge. Current research focuses on addressing the challenge of unlabeled data by extracting a subset that closely approximates negative samples. Regrettably, the remaining data are overlooked, failing to fully integrate this valuable information into the construction of user preferences. To address this gap, we introduce a novel positive-neutral-negative (PNN) learning paradigm. PNN introduces a neutral class, encompassing intricate items that are challenging to categorize directly as positive or negative samples. By training a model based on this triple-wise partial ranking, PNN offers a promising solution to learning complex user preferences. Through theoretical analysis, we connect PNN to one-way partial AUC (OPAUC) to validate its efficacy. Implementing the PNN paradigm is, however, technically challenging because: (1) it is difficult to classify unlabeled data into neutral or negative in the absence of supervised signals; (2) there does not exist any loss function that can handle set-level triple-wise ranking relationships. To address these challenges, we propose a semi-supervised learning method coupled with a user-aware attention model for knowledge acquisition and classification refinement. Additionally, a novel loss function with a two-step centroid ranking approach enables handling set-level rankings. Extensive experiments on four real-world datasets demonstrate that, when combined with PNN, a wide range of representative CF models can consistently and significantly boost their performance. Even with a simple matrix factorization, PNN can achieve comparable performance to sophisticated graph neutral networks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。