A Unified Model for Recommendation with Selective Neighborhood Modeling

• URL: http://arxiv.org/abs/2010.08547v1
• Date: Mon, 19 Oct 2020 08:06:16 GMT
• Title: A Unified Model for Recommendation with Selective Neighborhood Modeling
• Authors: Jingwei Ma and Jiahui Wen and Panpan Zhang and Guangda Zhang and Xue Li
• Abstract summary: We propose a novel neighborhood-based recommender, where a hybrid gated network is designed to automatically separate similar neighbors from dissimilar (noisy) ones. We show that the proposed model consistently outperforms state-of-the-art neighborhood-based recommenders.
• Score: 9.367539466637664
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neighborhood-based recommenders are a major class of Collaborative Filtering (CF) models. The intuition is to exploit neighbors with similar preferences for bridging unseen user-item pairs and alleviating data sparseness. Many existing works propose neural attention networks to aggregate neighbors and place higher weights on specific subsets of users for recommendation. However, the neighborhood information is not necessarily always informative, and the noises in the neighborhood can negatively affect the model performance. To address this issue, we propose a novel neighborhood-based recommender, where a hybrid gated network is designed to automatically separate similar neighbors from dissimilar (noisy) ones, and aggregate those similar neighbors to comprise neighborhood representations. The confidence in the neighborhood is also addressed by putting higher weights on the neighborhood representations if we are confident with the neighborhood information, and vice versa. In addition, a user-neighbor component is proposed to explicitly regularize user-neighbor proximity in the latent space. These two components are combined into a unified model to complement each other for the recommendation task. Extensive experiments on three publicly available datasets show that the proposed model consistently outperforms state-of-the-art neighborhood-based recommenders. We also study different variants of the proposed model to justify the underlying intuition of the proposed hybrid gated network and user-neighbor modeling components.

Related papers

• Towards Adaptive Neighborhood for Advancing Temporal Interaction Graph Modeling [19.831424038609462]
  Temporal Graph Networks (TGNs) have demonstrated their remarkable performance in modeling temporal interaction graphs. In this paper, we aim to enhance existing TGNs by introducing an adaptive neighborhood encoding mechanism. We present SEAN, a flexible plug-and-play model that can be seamlessly integrated with existing TGNs.
  arXiv  Detail & Related papers  (2024-06-14T07:57:17Z)
• Non-Neighbors Also Matter to Kriging: A New Contrastive-Prototypical Learning [24.701170582359104]
  Existing works assume that neighbors' information offers the basis for estimating the attributes of the unobserved target. We propose Contrastive-Prototypical'' self-supervised learning for Kriging to refine valuable information from neighbors and recycle the one from non-neighbors.
  arXiv  Detail & Related papers  (2024-01-23T11:46:31Z)
• Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendation [59.500347564280204]
  We propose a new Aleatoric Uncertainty-aware Recommendation (AUR) framework. AUR consists of a new uncertainty estimator along with a normal recommender model. As the chance of mislabeling reflects the potential of a pair, AUR makes recommendations according to the uncertainty.
  arXiv  Detail & Related papers  (2022-09-22T04:32:51Z)
• 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)
• Spatial Autoregressive Coding for Graph Neural Recommendation [38.66151035948021]
  shallow models and deep Graph Neural Networks (GNNs) fail to adequately exploit neighbor proximity in sampled subgraphs or sequences. In this paper, we propose a novel framework SAC, namely Spatial Autoregressive Coding, to solve the above problems in a unified way. Experimental results on both public recommendation datasets and a real scenario web-scale dataset demonstrate the superiority of SAC compared with state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-05-19T12:00:01Z)
• Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning [29.482674624323835]
  We propose a novel contrastive learning approach, named Neighborhood-enriched Contrastive Learning, named NCL. For the structural neighbors on the interaction graph, we develop a novel structure-contrastive objective that regards users (or items) and their structural neighbors as positive contrastive pairs. In implementation, the representations of users (or items) and neighbors correspond to the outputs of different GNN layers.
  arXiv  Detail & Related papers  (2022-02-13T04:18:18Z)
• Masked Transformer for Neighhourhood-aware Click-Through Rate Prediction [74.52904110197004]
  We propose Neighbor-Interaction based CTR prediction, which put this task into a Heterogeneous Information Network (HIN) setting. In order to enhance the representation of the local neighbourhood, we consider four types of topological interaction among the nodes. We conduct comprehensive experiments on two real world datasets and the experimental results show that our proposed method outperforms state-of-the-art CTR models significantly.
  arXiv  Detail & Related papers  (2022-01-25T12:44:23Z)
• Correlation Clustering Reconstruction in Semi-Adversarial Models [70.11015369368272]
  Correlation Clustering is an important clustering problem with many applications. We study the reconstruction version of this problem in which one is seeking to reconstruct a latent clustering corrupted by random noise and adversarial modifications.
  arXiv  Detail & Related papers  (2021-08-10T14:46:17Z)
• Adversarial Examples for $k$-Nearest Neighbor Classifiers Based on Higher-Order Voronoi Diagrams [69.4411417775822]
  Adversarial examples are a widely studied phenomenon in machine learning models. We propose an algorithm for evaluating the adversarial robustness of $k$-nearest neighbor classification.
  arXiv  Detail & Related papers  (2020-11-19T08:49:10Z)
• Neighborhood Matching Network for Entity Alignment [71.24217694278616]
  Neighborhood Matching Network (NMN) is a novel entity alignment framework. NMN estimates the similarities between entities to capture both the topological structure and the neighborhood difference. It first uses a novel graph sampling method to distill a discriminative neighborhood for each entity. It then adopts a cross-graph neighborhood matching module to jointly encode the neighborhood difference for a given entity pair.
  arXiv  Detail & Related papers  (2020-05-12T08:26:15Z)
• Neighborhood and Graph Constructions using Non-Negative Kernel Regression [42.16401154367232]
  We present an alternative view of neighborhood selection, where we show that neighborhood construction is equivalent to a sparse signal approximation problem. We also propose an algorithm, non-negative kernel regression(NNK), for obtaining neighborhoods that lead to better sparse representation.
  arXiv  Detail & Related papers  (2019-10-21T13:58:14Z)

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.