Abstract
Traditional news media Web sites usually provide generic recommendations that are not personalized to the preferences of their users. Typically, news recommendation algorithms mainly rely on the long-term preferences of users and do not adjust their model to the continuous stream of short-lived incoming stories to capture short-term intentions revealed by users’ sessions. In this paper, we therefore study the problem of session-aware recommendations by running random walks on dynamic heterogeneous graphs. Concretely, we construct a heterogeneous information network consisting of users, news articles, news categories, locations and sessions. By using different (1) sliding time window sizes, (2) sub-graphs for model learning, (3) sequential article weighting strategies and (4) more diversified random walks, we perform recommendations in a second step. Our algorithm proposal is evaluated on three real-life data sets, and we demonstrate that our method outperforms state-of-the-art methods by delivering more accurate and diversified recommendations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
