Integrating User and Item Reviews in Deep Cooperative Neural Networks for Movie Recommendation

• URL: http://arxiv.org/abs/2205.06296v1
• Date: Thu, 12 May 2022 18:18:45 GMT
• Title: Integrating User and Item Reviews in Deep Cooperative Neural Networks for Movie Recommendation
• Authors: Aristeidis Karras, Christos Karras
• Abstract summary: This work presents a deep model for concurrently learning item attributes and user behaviour from review text. One of the networks focuses on learning user behaviour from reviews submitted by the user, while the other network learns item attributes from user reviews. Similar to factorization machine approaches, the shared layer allows latent factors acquired for people and things to interact with each other.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: User evaluations include a significant quantity of information across online platforms. This information source has been neglected by the majority of existing recommendation systems, despite its potential to ease the sparsity issue and enhance the quality of suggestions. This work presents a deep model for concurrently learning item attributes and user behaviour from review text. Deep Cooperative Neural Networks (DeepCoNN) is the suggested model consisting of two parallel neural networks connected in their final layers. One of the networks focuses on learning user behaviour from reviews submitted by the user, while the other network learns item attributes from user reviews. On top, a shared layer is added to connect these two networks. Similar to factorization machine approaches, the shared layer allows latent factors acquired for people and things to interact with each other. On a number of datasets, DeepCoNN surpasses all baseline recommendation systems, according to experimental findings.

Related papers

• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback. We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Hierarchical Structured Neural Network: Efficient Retrieval Scaling for Large Scale Recommendation [16.21377996349377]
  We introduce the Hierarchical Structured Neural Network (HSNN), an efficient deep neural network model to learn intricate user and item interactions. HSNN achieves substantial improvement in offline evaluation compared to prevailing methods.
  arXiv  Detail & Related papers  (2024-08-13T05:53:46Z)
• k-Winners-Take-All Ensemble Neural Network [0.0]
  We modify an ensembling approach by training the sub-networks concurrently instead of independently. We compare our approach with the cooperative ensemble and mixture-of-experts, where we used a feed-forward neural network with one hidden layer having 100 neurons as the sub-network architecture.
  arXiv  Detail & Related papers  (2024-01-04T06:40:32Z)
• 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)
• DIAL: Deep Interactive and Active Learning for Semantic Segmentation in Remote Sensing [34.209686918341475]
  We propose to build up a collaboration between a deep neural network and a human in the loop. In a nutshell, the agent iteratively interacts with the network to correct its initially flawed predictions. We show that active learning based on uncertainty estimation enables to quickly lead the user towards mistakes.
  arXiv  Detail & Related papers  (2022-01-04T09:11:58Z)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• BCFNet: A Balanced Collaborative Filtering Network with Attention Mechanism [106.43103176833371]
  Collaborative Filtering (CF) based recommendation methods have been widely studied. We propose a novel recommendation model named Balanced Collaborative Filtering Network (BCFNet) In addition, an attention mechanism is designed to better capture the hidden information within implicit feedback and strengthen the learning ability of the neural network.
  arXiv  Detail & Related papers  (2021-03-10T14:59:23Z)
• Local Critic Training for Model-Parallel Learning of Deep Neural Networks [94.69202357137452]
  We propose a novel model-parallel learning method, called local critic training. We show that the proposed approach successfully decouples the update process of the layer groups for both convolutional neural networks (CNNs) and recurrent neural networks (RNNs) We also show that trained networks by the proposed method can be used for structural optimization.
  arXiv  Detail & Related papers  (2021-02-03T09:30:45Z)
• Node2Seq: Towards Trainable Convolutions in Graph Neural Networks [59.378148590027735]
  We propose a graph network layer, known as Node2Seq, to learn node embeddings with explicitly trainable weights for different neighboring nodes. For a target node, our method sorts its neighboring nodes via attention mechanism and then employs 1D convolutional neural networks (CNNs) to enable explicit weights for information aggregation. In addition, we propose to incorporate non-local information for feature learning in an adaptive manner based on the attention scores.
  arXiv  Detail & Related papers  (2021-01-06T03:05:37Z)
• Representation Extraction and Deep Neural Recommendation for Collaborative Filtering [9.367612782346207]
  This paper investigates the usage of novel representation learning algorithms to extract users and items representations from rating matrix. We propose a modular algorithm consisted of two main phases: REpresentation eXtraction and a deep neural NETwork (RexNet) RexNet is not dependent on unstructured auxiliary data such as visual and textual information, instead, it uses only the user-item rate matrix as its input.
  arXiv  Detail & Related papers  (2020-12-09T11:15:23Z)
• ReMarNet: Conjoint Relation and Margin Learning for Small-Sample Image Classification [49.87503122462432]
  We introduce a novel neural network termed Relation-and-Margin learning Network (ReMarNet) Our method assembles two networks of different backbones so as to learn the features that can perform excellently in both of the aforementioned two classification mechanisms. Experiments on four image datasets demonstrate that our approach is effective in learning discriminative features from a small set of labeled samples.
  arXiv  Detail & Related papers  (2020-06-27T13:50:20Z)

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.