BriefGPT.xyz
Jun, 2023
搜索和推荐中 Pareto 最优解的事后选择
Post-hoc Selection of Pareto-Optimal Solutions in Search and Recommendation
HTML
PDF
Vincenzo Paparella, Vito Walter Anelli, Franco Maria Nardini, Raffaele Perego, Tommaso Di Noia
TL;DR
本文提出了一种名为“从乌托邦到现实”的算法(PDU),用于识别和选择帕累托最优解以解决信息检索和推荐系统中的多目标问题,并通过实验证明其优于现有策略。
Abstract
information retrieval
(IR) and
recommender systems
(RS) tasks are moving from computing a ranking of final results based on a single metric to
mu
→