Efficient Graph Models for Retrieving Top-k News Feeds from Ego Networks

摘要

A key challenge of web platforms like social networking sites and services for news feed aggregation is the efficient and targeted distribution of new content items to users. This can be formulated as the problem of retrieving the top-k news items out of the d-degree ego network of each given user, where the set of all users producing feeds is of size n, with n >> d >> k and typically k