arXiv:2502.09050cs.IRcs.AI2025-02被引 6

用多视角图滤波快速实现群体推荐,无需复杂训练

Leveraging Member-Group Relations via Multi-View Graph Filtering for Effective Group Recommendation

  • 构建三个物品相似性图,从不同视角捕捉成员与群体关系
  • 通过多项式图滤波聚合结果,推理速度比传统方法快3倍以上
  • 适合需要低延迟推荐的场景,如实时群体购物建议

群体推荐旨在为多样化群体提供定制化推荐,使群体成员共同享受合适内容。现有方法多基于深度神经网络(DNN),虽能捕捉成员与群体间的复杂交互,但需昂贵且复杂的训练过程。为此,本文提出Group-GF,一种基于多视图图滤波(GF)的快速群体推荐方法,无需模型训练即可实现对每个群体的高效推荐。Group-GF首先构建三个反映不同视角的物品相似性图,然后为每张图设计独立的多项式图滤波器,并进行合理聚合。大量实验表明,Group-GF在显著降低运行时间的同时,达到当前最优推荐精度。

原文摘要 · Abstract (English)

Group recommendation aims at providing optimized recommendations tailored to diverse groups, enabling groups to enjoy appropriate items. On the other hand, most existing group recommendation methods are built upon deep neural network (DNN) architectures designed to capture the intricate relationships between member-level and group-level interactions. While these DNN-based approaches have proven their effectiveness, they require complex and expensive training procedures to incorporate group-level interactions in addition to member-level interactions. To overcome such limitations, we introduce Group-GF, a new approach for extremely fast recommendations of items to each group via multi-view graph filtering (GF) that offers a holistic view of complex member-group dynamics, without the need for costly model training. Specifically, in Group-GF, we first construct three item similarity graphs manifesting different viewpoints for GF. Then, we discover a distinct polynomial graph filter for each similarity graph and judiciously aggregate the three graph filters. Extensive experiments demonstrate the effectiveness of Group-GF in terms of significantly reducing runtime and achieving state-of-the-art recommendation accuracy.

群体推荐图滤波快速推理

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