Random Walks with Erasure: Diversifying Personalized Recommendations on Social and Information Networks

• URL: http://arxiv.org/abs/2102.09635v1
• Date: Thu, 18 Feb 2021 21:53:32 GMT
• Title: Random Walks with Erasure: Diversifying Personalized Recommendations on Social and Information Networks
• Authors: Bibek Paudel, Abraham Bernstein
• Abstract summary: We develop a novel recommendation framework with a goal of improving information diversity using a modified random walk exploration of the user-item graph. 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. Based on these estimated positions, we generate diversified personalized recommendations using our new random-walk based recommendation algorithm.
• Score: 4.007832851105161
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Relevance meets Diversity: A User-Centric Framework for Knowledge Exploration through Recommendations [15.143224593682012]
  We propose a novel recommendation strategy that combines relevance and diversity by a copula function. We use diversity as a surrogate of the amount of knowledge obtained by the user while interacting with the system. Our strategy outperforms several state-of-the-art competitors.
  arXiv  Detail & Related papers  (2024-08-07T13:48:24Z)
• How to Diversify any Personalized Recommender? A User-centric Pre-processing approach [0.0]
  We introduce a novel approach to improve the diversity of Top-N recommendations while maintaining recommendation performance. Our approach employs a user-centric pre-processing strategy aimed at exposing users to a wide array of content categories and topics.
  arXiv  Detail & Related papers  (2024-05-03T15:02:55Z)
• Randomized algorithms for precise measurement of differentially-private, personalized recommendations [6.793345945003182]
  We propose an algorithm for personalized recommendations that facilitates both precise and differentially-private measurement. We conduct offline experiments to quantify how the proposed privacy-preserving algorithm affects key metrics related to user experience, advertiser value, and platform revenue.
  arXiv  Detail & Related papers  (2023-08-07T17:34:58Z)
• PLIERS: a Popularity-Based Recommender System for Content Dissemination in Online Social Networks [5.505634045241288]
  We propose a novel tag-based recommender system called PLIERS. It relies on the assumption that users are mainly interested in items and tags with similar popularity to those they already own. PLIERS is aimed at reaching a good tradeoff between algorithmic and the level of personalization of recommended items.
  arXiv  Detail & Related papers  (2023-07-06T09:04:58Z)
• Improving Recommendation System Serendipity Through Lexicase Selection [53.57498970940369]
  We propose a new serendipity metric to measure the presence of echo chambers and homophily in recommendation systems. We then attempt to improve the diversity-preservation qualities of well known recommendation techniques by adopting a parent selection algorithm known as lexicase selection. Our results show that lexicase selection, or a mixture of lexicase selection and ranking, outperforms its purely ranked counterparts in terms of personalization, coverage and our specifically designed serendipity benchmark.
  arXiv  Detail & Related papers  (2023-05-18T15:37:38Z)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• Two-Stage Neural Contextual Bandits for Personalised News Recommendation [50.3750507789989]
  Existing personalised news recommendation methods focus on exploiting user interests and ignores exploration in recommendation. We build on contextual bandits recommendation strategies which naturally address the exploitation-exploration trade-off. We use deep learning representations for users and news, and generalise the neural upper confidence bound (UCB) policies to generalised additive UCB and bilinear UCB.
  arXiv  Detail & Related papers  (2022-06-26T12:07:56Z)
• Recommending with Recommendations [1.1602089225841632]
  Recommendation systems often draw upon sensitive user information in making predictions. We show how to address this deficiency by basing a service's recommendation engine upon recommendations from other existing services. In our setting, the user's (potentially sensitive) information belongs to a high-dimensional latent space.
  arXiv  Detail & Related papers  (2021-12-02T04:30:15Z)
• Personalized multi-faceted trust modeling to determine trust links in social media and its potential for misinformation management [61.88858330222619]
  We present an approach for predicting trust links between peers in social media. We propose a data-driven multi-faceted trust modeling which incorporates many distinct features for a comprehensive analysis. Illustrated in a trust-aware item recommendation task, we evaluate the proposed framework in the context of a large Yelp dataset.
  arXiv  Detail & Related papers  (2021-11-11T19:40:51Z)
• Learning Diverse Fashion Collocation by Neural Graph Filtering [78.9188246136867]
  We propose a novel fashion collocation framework, Neural Graph Filtering, that models a flexible set of fashion items via a graph neural network. By applying symmetric operations on the edge vectors, this framework allows varying numbers of inputs/outputs and is invariant to their ordering. We evaluate the proposed approach on three popular benchmarks, the Polyvore dataset, the Polyvore-D dataset, and our reorganized Amazon Fashion dataset.
  arXiv  Detail & Related papers  (2020-03-11T16:17:08Z)
• A Survey on Knowledge Graph-Based Recommender Systems [65.50486149662564]
  We conduct a systematical survey of knowledge graph-based recommender systems. We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation. We introduce datasets used in these works.
  arXiv  Detail & Related papers  (2020-02-28T02:26:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.