Exploring the use of Time-Dependent Cross-Network Information for Personalized Recommendations

• URL: http://arxiv.org/abs/2008.10866v1
• Date: Tue, 25 Aug 2020 07:52:47 GMT
• Title: Exploring the use of Time-Dependent Cross-Network Information for Personalized Recommendations
• Authors: Dilruk Perera and Roger Zimmermann
• Abstract summary: We propose a novel cross-network time aware recommender solution. The solution learns historical user models in the target network by aggregating user preferences from multiple source networks. Experiments conducted using multiple time aware and cross-network baselines show that the proposed solution achieves superior performance in terms of accuracy, novelty and diversity.
• Score: 33.17802459749589
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The overwhelming volume and complexity of information in online applications make recommendation essential for users to find information of interest. However, two major limitations that coexist in real world applications (1) incomplete user profiles, and (2) the dynamic nature of user preferences continue to degrade recommender quality in aspects such as timeliness, accuracy, diversity and novelty. To address both the above limitations in a single solution, we propose a novel cross-network time aware recommender solution. The solution first learns historical user models in the target network by aggregating user preferences from multiple source networks. Second, user level time aware latent factors are learnt to develop current user models from the historical models and conduct timely recommendations. We illustrate our solution by using auxiliary information from the Twitter source network to improve recommendations for the YouTube target network. Experiments conducted using multiple time aware and cross-network baselines under different time granularities show that the proposed solution achieves superior performance in terms of accuracy, novelty and diversity.

Related papers

• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations [92.47380209981348]
  We propose a Diverse Preference Augmentation framework with multiple source domains based on meta-learning. We generate diverse ratings in a new domain of interest to handle overfitting on the case of sparse interactions. These ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability.
  arXiv  Detail & Related papers  (2022-04-01T10:10:50Z)
• Incremental Learning for Personalized Recommender Systems [8.020546404087922]
  We present an incremental learning solution to provide both the training efficiency and the model quality. The solution is deployed in LinkedIn and directly applicable to industrial scale recommender systems.
  arXiv  Detail & Related papers  (2021-08-13T04:21:21Z)
• Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations [85.6250759280292]
  Cross domain recommender systems have been increasingly valuable for helping consumers identify useful items in different applications. Existing cross-domain models typically require large number of overlap users, which can be difficult to obtain in some applications. We propose a novel cross-domain recommendation model based on dual learning that transfers information between two related domains in an iterative manner.
  arXiv  Detail & Related papers  (2021-04-17T09:18:59Z)
• Towards Comprehensive Recommender Systems: Time-Aware UnifiedcRecommendations Based on Listwise Ranking of Implicit Cross-Network Data [33.17802459749589]
  We propose a novel deep learning based unified cross-network solution to mitigate cold-start and data sparsity issues. We show that the proposed solution is superior in terms of accuracy, novelty and diversity. Experiments conducted on the popular MovieLens dataset suggest that the proposed listwise ranking method outperforms existing state-of-the-art ranking techniques.
  arXiv  Detail & Related papers  (2020-08-25T08:08:03Z)
• LSTM Networks for Online Cross-Network Recommendations [33.17802459749589]
  Cross-network recommender systems use auxiliary information from multiple source networks to create holistic user profiles and improve recommendations in a target network. We find two major limitations in existing cross-network solutions that reduce overall recommender performance. We propose a novel multi-layered Long Short-Term Memory (LSTM) network based online solution to mitigate these issues.
  arXiv  Detail & Related papers  (2020-08-25T07:10:24Z)
• CnGAN: Generative Adversarial Networks for Cross-network user preference generation for non-overlapped users [33.17802459749589]
  A major drawback of cross-network recommender solutions is that they can only be applied to users that are overlapped across networks. We propose CnGAN, a novel multi-task learning based, encoder-GAN-recommender architecture. The resultant user preferences are used in a Siamese network based neural recommender architecture.
  arXiv  Detail & Related papers  (2020-08-25T06:47:44Z)
• MRIF: Multi-resolution Interest Fusion for Recommendation [0.0]
  This paper presents a multi-resolution interest fusion model (MRIF) that takes both properties of users' interests into consideration. The proposed model is capable to capture the dynamic changes in users' interests at different temporal-ranges, and provides an effective way to combine a group of multi-resolution user interests to make predictions.
  arXiv  Detail & Related papers  (2020-07-08T02:32:15Z)
• Sequential Recommender via Time-aware Attentive Memory Network [67.26862011527986]
  We propose a temporal gating methodology to improve attention mechanism and recurrent units. We also propose a Multi-hop Time-aware Attentive Memory network to integrate long-term and short-term preferences. Our approach is scalable for candidate retrieval tasks and can be viewed as a non-linear generalization of latent factorization for dot-product based Top-K recommendation.
  arXiv  Detail & Related papers  (2020-05-18T11:29:38Z)
• Unsupervised Model Personalization while Preserving Privacy and Scalability: An Open Problem [55.21502268698577]
  This work investigates the task of unsupervised model personalization, adapted to continually evolving, unlabeled local user images. We provide a novel Dual User-Adaptation framework (DUA) to explore the problem. This framework flexibly disentangles user-adaptation into model personalization on the server and local data regularization on the user device.
  arXiv  Detail & Related papers  (2020-03-30T09:35:12Z)

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.