We use cookies to improve your experience with our site.

Trinity——一种基于用户-对象-标签异质网络游走的个性化推荐方法

Trinity: Walking on a User-Object-Tag Heterogeneous Network for Personalised Recommendations

  • 摘要: 互联网的迅速发展迫切需要推荐系统能够从在线资源中迅速筛选出有用信息。虽然用户-对象评分数据仍是推荐系统中广泛使用的重要信息, 最新研究进展已经表明标签信息的引入能够改善推荐系统的性能。此外, 标签深受卓有成效的在线社会化媒体如 CiteULike, MovieLens和Bibsonomy的重视, 使得用户能够轻松表达自己的喜好, 上传资源以及管理个性化标签。然而, 大多数现有的基于标签的推荐方法将用户、对象和标签作为一个三部图, 从而忽视了同一类型节点之间的关系。为了克服这种局限性, 我们提出了一个名为Trinity的新方法, 将历史数据和标签信息集成起来, 在所构建的用户-对象-标签三层网络上进行带重启动的随机游走。Trinity不仅考虑了网络中异质节点的关联, 而且考虑了同质节点的关联。我们通过10倍交叉验证的实验方法验证了方法的有效性。结果表明, 该方法在三类综合评价指标下的推荐性能, 不仅明显优于基于用户和基于对象的协同过滤方法, 而且明显优于基于用户-对象-标签的三部图游走等方法。

     

    Abstract: The rapid evolution of the Internet has been appealing for effective recommender systems to pinpoint useful information from online resources. Although historical rating data has been widely used as the most important information in recommendation methods, recent advancements have been demonstrating the improvement in recommendation performance with the incorporation of tag information. Furthermore, the availability of tag annotations has been well addressed by such fruitful online social tagging applications as CiteULike, MovieLens and BibSonomy, which allow users to express their preferences, upload resources and assign their own tags. Nevertheless, most existing tag-aware recommendation approaches model relationships among users, objects and tags using a tripartite graph, and hence overlook relationships within the same types of nodes. To overcome this limitation, we propose a novel approach, Trinity, to integrate historical data and tag information towards personalised recommendation. Trinity constructs a three-layered object-user-tag network that considers not only interconnections between different types of nodes but also relationships within the same types of nodes. Based on this heterogeneous network, Trinity adopts a random walk with restart model to assign the strength of associations to candidate objects, thereby providing a means of prioritizing the objects for a query user. We validate our approach via a series of large-scale 10-fold cross-validation experiments and evaluate its performance using three comprehensive criteria. Results show that our method outperforms several existing methods, including supervised random walk with restart, simulation of resource allocating processes, and traditional collaborative filtering.

     

/

返回文章
返回