论文标题

Wikipedia文章的可扩展建议使用代表学习向编辑人员

Scalable Recommendation of Wikipedia Articles to Editors Using Representation Learning

论文作者

Moskalenko, Oleksii, Parra, Denis, Saez-Trumper, Diego

论文摘要

Wikipedia由世界各地的志愿编辑编辑。考虑到大量现有内容(例如,英语Wikipedia中的500万篇文章),确定接下来要编辑的内容可能很困难,这都是经验丰富的用户,这些用户通常都有巨大的积压文章优先级的,以及对于那些可能需要指导下一篇文章来贡献的新移民。因此,帮助编辑查找相关文章应提高其性能并帮助保留新编辑者。在本文中,我们解决了向编辑推荐相关文章的问题。为此,我们在图形卷积网络和DOC2VEC之上开发了一个可扩展系统,学习如何表示Wikipedia文章并为编辑提供个性化建议。我们测试了编辑历史记录的模型,并根据其先前的编辑来预测其最新编辑。我们的表现优于竞争性的隐式反馈协作过滤方法,例如基于ALS的WMRF,以及基于BM25的基于内容的过滤等传统的IR方法。本文使用的所有数据均可公开使用,包括Wikipedia文章的图形嵌入,我们发布了代码以支持我们实验的复制。此外,我们通过可扩展的嵌入算法的可扩展实现,因为当前的算法无法有效处理Wikipedia图的纯粹大小。

Wikipedia is edited by volunteer editors around the world. Considering the large amount of existing content (e.g. over 5M articles in English Wikipedia), deciding what to edit next can be difficult, both for experienced users that usually have a huge backlog of articles to prioritize, as well as for newcomers who that might need guidance in selecting the next article to contribute. Therefore, helping editors to find relevant articles should improve their performance and help in the retention of new editors. In this paper, we address the problem of recommending relevant articles to editors. To do this, we develop a scalable system on top of Graph Convolutional Networks and Doc2Vec, learning how to represent Wikipedia articles and deliver personalized recommendations for editors. We test our model on editors' histories, predicting their most recent edits based on their prior edits. We outperform competitive implicit-feedback collaborative-filtering methods such as WMRF based on ALS, as well as a traditional IR-method such as content-based filtering based on BM25. All of the data used on this paper is publicly available, including graph embeddings for Wikipedia articles, and we release our code to support replication of our experiments. Moreover, we contribute with a scalable implementation of a state-of-art graph embedding algorithm as current ones cannot efficiently handle the sheer size of the Wikipedia graph.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源