用图结构提升电商任务型搜索召回率,效果显著且通用。
GRIT: Graph-based Recall Improvement for Task-oriented E-commerce Queries
- 构建商品间相似图,利用点击或标注数据挖掘上下文关联。
- 在检索阶段优先引入相关性更高的邻居商品,最高提升6.3%召回率。
- 适用于传统与任务型查询,兼容多种检索方法,鲁棒性强。
电商平台搜索通常包含四个阶段:检索、过滤、排序和个性化重排。其中检索阶段必须高效且高召回,因遗漏的商品无法在后续阶段被考虑。这对具有行动意图的任务型查询(需结合上下文理解)构成挑战。为此,我们基于大模型构建了新的任务型查询基准(TQE),基于现有ESCI商品搜索数据集。同时提出新型方法GRIT(Graph-based Recall Improvement for Task-oriented queries),显著优于当前主流的词法、稠密及学习稀疏基线。系统支持传统与任务型查询,最高实现6.3%召回率提升。在索引阶段,GRIT利用用户点击或人工标注数据构建商品-商品相似图;在检索阶段,通过识别上下文与行动相关性更高的邻居商品,优先其候选结果,从而提升初始检索结果的全面性与相关性。该方法充分利用图中邻近节点提供的局部关系与上下文洞察,增强第一阶段检索效果。实验表明,该方法对所有参数设置均表现稳健,并可有效适配多种第一阶段检索策略。
原文摘要 · Abstract (English)
Many e-commerce search pipelines have four stages, namely: retrieval, filtering, ranking, and personalized-reranking. The retrieval stage must be efficient and yield high recall because relevant products missed in the first stage cannot be considered in later stages. This is challenging for task-oriented queries (queries with actionable intent) where user requirements are contextually intensive and difficult to understand. To foster research in the domain of e-commerce, we created a novel benchmark for Task-oriented Queries (TQE) by using LLM, which operates over the existing ESCI product search dataset. Furthermore, we propose a novel method 'Graph-based Recall Improvement for Task-oriented queries' (GRIT) to address the most crucial first-stage recall improvement needs. GRIT leads to robust and statistically significant improvements over state-of-the-art lexical, dense, and learned-sparse baselines. Our system supports both traditional and task-oriented e-commerce queries, yielding up to 6.3% recall improvement. In the indexing stage, GRIT first builds a product-product similarity graph using user clicks or manual annotation data. During retrieval, it locates neighbors with higher contextual and action relevance and prioritizes them over the less relevant candidates from the initial retrieval. This leads to a more comprehensive and relevant first-stage result set that improves overall system recall. Overall, GRIT leverages the locality relationships and contextual insights provided by the graph using neighboring nodes to enrich the first-stage retrieval results. We show that the method is not only robust across all introduced parameters, but also works effectively on top of a variety of first-stage retrieval methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。