LSTM Networks for Online Cross-Network Recommendations

• URL: http://arxiv.org/abs/2008.10849v2
• Date: Thu, 3 Sep 2020 09:34:10 GMT
• Title: LSTM Networks for Online Cross-Network Recommendations
• Authors: Dilruk Perera and Roger Zimmermann
• Abstract summary: 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.
• Score: 33.17802459749589
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross-network recommender systems use auxiliary information from multiple source networks to create holistic user profiles and improve recommendations in a target network. However, we find two major limitations in existing cross-network solutions that reduce overall recommender performance. Existing models (1) fail to capture complex non-linear relationships in user interactions, and (2) are designed for offline settings hence, not updated online with incoming interactions to capture the dynamics in the recommender environment. We propose a novel multi-layered Long Short-Term Memory (LSTM) network based online solution to mitigate these issues. The proposed model contains three main extensions to the standard LSTM: First, an attention gated mechanism to capture long-term user preference changes. Second, a higher order interaction layer to alleviate data sparsity. Third, time aware LSTM cell gates to capture irregular time intervals between user interactions. We illustrate our solution using auxiliary information from Twitter and Google Plus to improve recommendations on YouTube. Extensive experiments show that the proposed model consistently outperforms state-of-the-art in terms of accuracy, diversity and novelty.

Related papers

• DIET: Customized Slimming for Incompatible Networks in Sequential Recommendation [16.44627200990594]
  recommender systems start to deploy models on edges to alleviate network congestion caused by frequent mobile requests. Several studies have leveraged the proximity of edge-side to real-time data, fine-tuning them to create edge-specific models. These methods require substantial on-edge computational resources and frequent network transfers to keep the model up to date. We propose a customizeD slImming framework for incompatiblE neTworks(DIET). DIET deploys the same generic backbone (potentially incompatible for a specific edge) to all devices.
  arXiv  Detail & Related papers  (2024-06-13T04:39:16Z)
• Linear-Time Graph Neural Networks for Scalable Recommendations [50.45612795600707]
  The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions. Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems. We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
  arXiv  Detail & Related papers  (2024-02-21T17:58:10Z)
• Leveraging Low-Rank and Sparse Recurrent Connectivity for Robust Closed-Loop Control [63.310780486820796]
  We show how a parameterization of recurrent connectivity influences robustness in closed-loop settings. We find that closed-form continuous-time neural networks (CfCs) with fewer parameters can outperform their full-rank, fully-connected counterparts.
  arXiv  Detail & Related papers  (2023-10-05T21:44:18Z)
• Multi-behavior Self-supervised Learning for Recommendation [36.42241501002167]
  We propose a Multi-Behavior Self-Supervised Learning (MBSSL) framework together with an adaptive optimization method. Specifically, we devise a behavior-aware graph neural network incorporating the self-attention mechanism to capture behavior multiplicity and dependencies. Experiments on five real-world datasets demonstrate the consistent improvements obtained by MBSSL over ten state-of-the art (SOTA) baselines.
  arXiv  Detail & Related papers  (2023-05-22T15:57:32Z)
• Interference Cancellation GAN Framework for Dynamic Channels [74.22393885274728]
  We introduce an online training framework that can adapt to any changes in the channel. Our framework significantly outperforms recent neural network models on highly dynamic channels.
  arXiv  Detail & Related papers  (2022-08-17T02:01:18Z)
• Adaptive Target-Condition Neural Network: DNN-Aided Load Balancing for Hybrid LiFi and WiFi Networks [19.483289519348315]
  Machine learning has the potential to provide a complexity-friendly load balancing solution. The state-of-the-art (SOTA) learning-aided LB methods need retraining when the network environment changes. A novel deep neural network (DNN) structure named adaptive target-condition neural network (A-TCNN) is proposed.
  arXiv  Detail & Related papers  (2022-08-09T20:46:13Z)
• Learning towards Synchronous Network Memorizability and Generalizability for Continual Segmentation across Multiple Sites [52.84959869494459]
  In clinical practice, a segmentation network is often required to continually learn on a sequential data stream from multiple sites. Existing methods are usually restricted in either network memorizability on previous sites or generalizability on unseen sites. This paper aims to tackle the problem of Synchronous Memorizability and Generalizability with a novel proposed SMG-learning framework.
  arXiv  Detail & Related papers  (2022-06-14T13:04:36Z)
• Collaborative Reflection-Augmented Autoencoder Network for Recommender Systems [23.480069921831344]
  We develop a Collaborative Reflection-Augmented Autoencoder Network (CRANet) CRANet is capable of exploring transferable knowledge from observed and unobserved user-item interactions. We experimentally validate CRANet on four diverse benchmark datasets corresponding to two recommendation tasks.
  arXiv  Detail & Related papers  (2022-01-10T04:36:15Z)
• Contrastive Self-supervised Sequential Recommendation with Robust Augmentation [101.25762166231904]
  Sequential Recommendationdescribes a set of techniques to model dynamic user behavior in order to predict future interactions in sequential user data. Old and new issues remain, including data-sparsity and noisy data. We propose Contrastive Self-Supervised Learning for sequential Recommendation (CoSeRec)
  arXiv  Detail & Related papers  (2021-08-14T07:15:25Z)
• JUMBO: Scalable Multi-task Bayesian Optimization using Offline Data [86.8949732640035]
  We propose JUMBO, an MBO algorithm that sidesteps limitations by querying additional data. We show that it achieves no-regret under conditions analogous to GP-UCB. Empirically, we demonstrate significant performance improvements over existing approaches on two real-world optimization problems.
  arXiv  Detail & Related papers  (2021-06-02T05:03:38Z)
• Exploring the use of Time-Dependent Cross-Network Information for Personalized Recommendations [33.17802459749589]
  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.
  arXiv  Detail & Related papers  (2020-08-25T07:52:47Z)

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.