Random Walks with Erasure: Diversifying Personalized Recommendations on Social and Information Networks
Most existing personalization systems promote items that match a user's previous choices or those that are popular among similar users. This results in recommendations that are highly similar to the ones users are already exposed to, resulting in their isolation inside familiar but insulated information silos. In this context, we develop a novel recommendation framework with a goal of improving information diversity using a modified random walk exploration of the user-item graph. We focus on the problem of political content recommendation, while addressing a general problem applicable to personalization tasks in other social and information networks. For recommending political content on social networks, we first propose a new model to estimate the ideological positions for both users and the content they share, which is able to recover ideological positions with high accuracy. Based on these estimated positions, we generate diversified personalized recommendations using our new random-walk based recommendation algorithm. With experimental evaluations on large datasets of Twitter discussions, we show that our method based on \emph{random walks with erasure} is able to generate more ideologically diverse recommendations. Our approach does not depend on the availability of labels regarding the bias of users or content producers. With experiments on open benchmark datasets from other social and information networks, we also demonstrate the effectiveness of our method in recommending diverse long-tail items.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Diversified recommendations of cultural activities with personalized determinantal point processes
While optimizing recommendation systems for user engagement is a well-established practice, effectively diversifying recommendations without negatively impacting core business metrics remains a significant industry chall…
Recommendation SystemsPoint ProcessesRecommender Systems with Random Walks: A Survey
Recommender engines have become an integral component in today's e-commerce systems. From recommending books in Amazon to finding friends in social networks such as Facebook, they have become omnipresent. Generally, re…
Collaborative FilteringRecommendation SystemsSurveyBoosting Item-based Collaborative Filtering via Nearly Uncoupled Random Walks
Item-based models are among the most popular collaborative filtering approaches for building recommender systems. Random walks can provide a powerful tool for harvesting the rich network of interactions captured within t…
Collaborative FilteringRecommendation Systemsdiv2vec: Diversity-Emphasized Node Embedding
Recently, the interest of graph representation learning has been rapidly increasing in recommender systems. However, most existing studies have focused on improving accuracy, but in real-world systems, the recommendation…
DiversityGraph Representation LearningRecommendation SystemsRepresentation LearningTrust your neighbors: A comprehensive survey of neighborhood-based methods for recommender systems
Collaborative recommendation approaches based on nearest-neighbors are still highly popular today due to their simplicity, their efficiency, and their ability to produce accurate and personalized recommendations. This ch…
Recommendation Systems