arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.03030cs.IR
收藏

一种新的基于高效算法的系统范围推荐多样性度量

A new system-wide diversity measure for recommendations with efficient algorithms

Arda Antikacioglu, Tanvi Bajpai, R. Ravi

摘要:

推荐系统通常对按类型聚类的项目目录和按人口统计学或心理学属性自然聚类为用户类型的用户库进行操作。以前关于全系统多样性的工作主要集中在定义这些类别之间的意图感知指标,并最大限度地提高所产生的建议的相关性,但没有从项目和用户两个角度结合多样性的概念。在这项工作中,(1)我们引入了两个新的系统范围内的多样性度量,同时解决多样化的问题,每个用户看到的项目的类别,多样化的用户类型,每个项目显示,并保持高推荐质量。我们将其建模为用户和项目之间候选推荐的二分图上的子图选择问题。(2)在不相交的项目类别和用户类型的情况下,我们表明,由此产生的问题可以在多项式时间内精确地解决,通过减少到最小成本流问题。(3)在非不相交的类别和用户类型的情况下,我们证明了NP-完全的目标,并提出了有效的近似算法使用的子模块的目标。(4)最后,我们在MovieLens-1 m和Netflix数据集上验证了我们的算法的有效性,并表明为我们的目标设计的算法在销售多样性指标上也表现良好,甚至在一些意图感知的多样性指标上也表现良好。我们的实验结果证明了我们的新的复合多样性指标的有效性。

英文摘要:

Recommender systems often operate on item catalogs clustered by genres, and user bases that have natural clusterings into user types by demographic or psychographic attributes. Prior work on system-wide diversity has mainly focused on defining intent-aware metrics among such categories and maximizing relevance of the resulting recommendations, but has not combined the notions of diversity from the two point of views of items and users. In this work, (1) we introduce two new system-wide diversity metrics to simultaneously address the problems of diversifying the categories of items that each user sees, diversifying the types of users that each item is shown, and maintaining high recommendation quality. We model this as a subgraph selection problem on the bipartite graph of candidate recommendations between users and items. (2) In the case of disjoint item categories and user types, we show that the resulting problems can be solved exactly in polynomial time, by a reduction to a minimum cost flow problem. (3) In the case of non-disjoint categories and user types, we prove NP-completeness of the objective and present efficient approximation algorithms using the submodularity of the objective. (4) Finally, we validate the effectiveness of our algorithms on the MovieLens-1m and Netflix datasets, and show that algorithms designed for our objective also perform well on sales diversity metrics, and even some intent-aware diversity metrics. Our experimental results justify the validity of our new composite diversity metrics.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑