6533b830fe1ef96bd1296f10

RESEARCH PRODUCT

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

Jonas KunzeSteffen StaabThomas GottronRene PickhardtAnsgar Scherp

subject

Ego networksInformation retrievalGraph databaseTheoretical computer scienceSocial networkComputer sciencebusiness.industryScalabilityGraph (abstract data type)Graph theorybusinesscomputer.software_genrecomputer

description

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

yearjournalcountryeditionlanguage
2012-09-012012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
https://doi.org/10.1109/socialcom-passat.2012.73