在线社会网络网站上的游戏推荐算法性能表征
Performance Characterization of Game Recommendation Algorithms on Online Social Network Sites
-
摘要: 近年来,在线社会网络已经从一种简单的用户信息展示和交流网站演化为在线门户网站,用户可以在上面进行互动、分享和使用内容丰富的多媒体数据以及玩各种类型的游戏.由于这类在线游戏非常流行并带来巨大的潜在收益,每天都会涌现出许多新的游戏,导致这类在线社交游戏的数量已经成千上万.在本文中,我们对用于推荐在线社交游戏的基于近邻的协同过滤算法进行了评估.用于评估的大规模数据集来自一个在线社交游戏平台,包含了游戏评级(显性数据)和数百万活跃用户的在线游戏行为(隐性数据).基于这些显性数据、隐性数据以及它们的组合,本文实现并评估了多种相似性度量指标.结果显示,这些当前常用于在线社交游戏网站的基于近邻的协同过滤算法的性能远胜于基于内容的算法.实验结果还显示,同时考虑显性数据和隐性数据的组合方法总体效果良好,所有的评价指标在各种场景中都获得了良好的结果,仅比只考虑显性数据或隐性数据情况下的最好结果略差.性能最优的算法目前已经被应用到一个活跃的在线游戏平台上.Abstract: Since years, online social networks have evolved from profile and communication websites to online portals where people interact with each other, share and consume multimedia-enriched data and play different types of games. Due to the immense popularity of these online games and their huge revenue potential, the number of these games increases every day, resulting in a current offering of thousands of online social games. In this paper, the applicability of neighborhood-based collaborative filtering (CF) algorithms for the recommendation of online social games is evaluated. This evaluation is based on a large dataset of an online social gaming platform containing game ratings (explicit data) and online gaming behavior (implicit data) of millions of active users. Several similarity metrics were implemented and evaluated on the explicit data, implicit data and a combination thereof. It is shown that the neighborhood-based CF algorithms greatly outperform the content-based algorithm, currently often used on online social gaming websites. The results also show that a combined approach, i.e., taking into account both implicit and explicit data at the same time, yields overall good results on all evaluation metrics for all scenarios, while only slightly performing worse compared to the strengths of the explicit or implicit only approaches. The best performing algorithms have been implemented in a live setup of the online game platform.