All-in-One: Heterogeneous Interaction Modeling for Cold-Start Rating Prediction

• URL: http://arxiv.org/abs/2403.17740v2
• Date: Thu, 28 Mar 2024 04:40:59 GMT
• Title: All-in-One: Heterogeneous Interaction Modeling for Cold-Start Rating Prediction
• Authors: Shuheng Fang, Kangfei Zhao, Yu Rong, Zhixun Li, Jeffrey Xu Yu,
• Abstract summary: We propose a flexible framework dubbed heterogeneous interaction rating network (HIRE) HIRE dose not solely rely on the pre-defined interaction pattern or the manually constructed heterogeneous information network. In the experiments, we evaluate our model under three cold-start settings on three real-world datasets.
• Score: 33.09413959289308
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cold-start rating prediction is a fundamental problem in recommender systems that has been extensively studied. Many methods have been proposed that exploit explicit relations among existing data, such as collaborative filtering, social recommendations and heterogeneous information network, to alleviate the data insufficiency issue for cold-start users and items. However, the explicit relations constructed based on data between different roles may be unreliable and irrelevant, which limits the performance ceiling of the specific recommendation task. Motivated by this, in this paper, we propose a flexible framework dubbed heterogeneous interaction rating network (HIRE). HIRE dose not solely rely on the pre-defined interaction pattern or the manually constructed heterogeneous information network. Instead, we devise a Heterogeneous Interaction Module (HIM) to jointly model the heterogeneous interactions and directly infer the important interactions via the observed data. In the experiments, we evaluate our model under three cold-start settings on three real-world datasets. The experimental results show that HIRE outperforms other baselines by a large margin. Furthermore, we visualize the inferred interactions of HIRE to confirm the contribution of our model.

Related papers

• Relation Learning and Aggregate-attention for Multi-person Motion Prediction [13.052342503276936]
  Multi-person motion prediction considers not just the skeleton structures or human trajectories but also the interactions between others. Previous methods often overlook that the joints relations within an individual (intra-relation) and interactions among groups (inter-relation) are distinct types of representations. We introduce a new collaborative framework for multi-person motion prediction that explicitly modeling these relations.
  arXiv  Detail & Related papers  (2024-11-06T07:48:30Z)
• Inferring effective couplings with Restricted Boltzmann Machines [3.150368120416908]
  Generative models attempt to encode correlations observed in the data at the level of the Boltzmann weight associated with an energy function in the form of a neural network. We propose a solution by implementing a direct mapping between the Restricted Boltzmann Machine and an effective Ising spin Hamiltonian.
  arXiv  Detail & Related papers  (2023-09-05T14:55:09Z)
• Interactive Graph Convolutional Filtering [79.34979767405979]
  Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising. These problems are exacerbated by the cold start problem and data sparsity problem. Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages. Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items.
  arXiv  Detail & Related papers  (2023-09-04T09:02:31Z)
• On the Joint Interaction of Models, Data, and Features [82.60073661644435]
  We introduce a new tool, the interaction tensor, for empirically analyzing the interaction between data and model through features. Based on these observations, we propose a conceptual framework for feature learning. Under this framework, the expected accuracy for a single hypothesis and agreement for a pair of hypotheses can both be derived in closed-form.
  arXiv  Detail & Related papers  (2023-06-07T21:35:26Z)
• Causal Disentangled Variational Auto-Encoder for Preference Understanding in Recommendation [50.93536377097659]
  This paper introduces the Causal Disentangled Variational Auto-Encoder (CaD-VAE), a novel approach for learning causal disentangled representations from interaction data in recommender systems. The approach utilizes structural causal models to generate causal representations that describe the causal relationship between latent factors.
  arXiv  Detail & Related papers  (2023-04-17T00:10:56Z)
• Modeling Instance Interactions for Joint Information Extraction with Neural High-Order Conditional Random Field [39.055053720433435]
  We introduce a joint IE framework (CRFIE) that formulates joint IE as a high-order Conditional Random Field. Specifically, we design binary factors and ternary factors to directly model interactions between not only a pair of instances but also triplets. We incorporate a high-order neural decoder that is unfolded from a mean-field variational inference method.
  arXiv  Detail & Related papers  (2022-12-17T18:45:23Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Exploring Entity Interactions for Few-Shot Relation Learning (Student Abstract) [26.487611287367443]
  Few-shot relation learning refers to infer facts for relations with a limited number of observed triples. In this paper, we explore this kind of fine-grained semantic meanings and propose our model TransAM. Experiments on two public benchmark datasets NELL-One and Wiki-One with 1-shot setting prove the effectiveness of TransAM.
  arXiv  Detail & Related papers  (2022-05-04T03:54:44Z)
• Privileged Graph Distillation for Cold Start Recommendation [57.918041397089254]
  The cold start problem in recommender systems requires recommending to new users (items) based on attributes without any historical interaction records. We propose a privileged graph distillation model(PGD) Our proposed model is generally applicable to different cold start scenarios with new user, new item, or new user-new item.
  arXiv  Detail & Related papers  (2021-05-31T14:05:27Z)
• Neural Graph Matching based Collaborative Filtering [13.086302251856756]
  We identify two different types of attribute interactions, inner and cross interactions. Existing models do not distinguish these two types of attribute interactions. We propose a neural Graph Matching based Collaborative Filtering model (GMCF) Our model outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2021-05-10T01:51:46Z)

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.