Enhancing the conformal predictability of context-aware recommendation systems by using Deep Autoencoders

• URL: http://arxiv.org/abs/2412.12110v1
• Date: Sat, 30 Nov 2024 18:24:42 GMT
• Title: Enhancing the conformal predictability of context-aware recommendation systems by using Deep Autoencoders
• Authors: Saloua Zammali, Siddhant Dutta, Sadok Ben Yahia,
• Abstract summary: We introduce a framework that combines neural contextual matrix factorization with autoencoders to predict user ratings for items. We conduct experiments on various real-world datasets and compare the results against state-of-the-art approaches.
• Score: 4.3012765978447565
• License:
• Abstract: In the field of Recommender Systems (RS), neural collaborative filtering represents a significant milestone by combining matrix factorization and deep neural networks to achieve promising results. Traditional methods like matrix factorization often rely on linear models, limiting their capability to capture complex interactions between users, items, and contexts. This limitation becomes particularly evident with high-dimensional datasets due to their inability to capture relationships among users, items, and contextual factors. Unsupervised learning and dimension reduction tasks utilize autoencoders, neural network-based models renowned for their capacity to encode and decode data. Autoencoders learn latent representations of inputs, reducing dataset size while capturing complex patterns and features. In this paper, we introduce a framework that combines neural contextual matrix factorization with autoencoders to predict user ratings for items. We provide a comprehensive overview of the framework's design and implementation. To evaluate its performance, we conduct experiments on various real-world datasets and compare the results against state-of-the-art approaches. We also extend the concept of conformal prediction to prediction rating and introduce a Conformal Prediction Rating (CPR). For RS, we define the nonconformity score, a key concept of conformal prediction, and demonstrate that it satisfies the exchangeability property.

Related papers

• Convolutional Transformer Neural Collaborative Filtering [0.24578723416255746]
  Convolutional Transformer Neural Collaborative Filtering (CTNCF) is a novel approach aimed at enhancing recommendation systems. CTNCF seamlessly integrates Convolutional Neural Networks (CNNs) and Transformer layers. To validate the effectiveness of our proposed CTNCF framework, we conduct extensive experiments on two real-world datasets.
  arXiv  Detail & Related papers  (2024-12-02T11:01:31Z)
• Optimizing Sequential Recommendation Models with Scaling Laws and Approximate Entropy [104.48511402784763]
  Performance Law for SR models aims to theoretically investigate and model the relationship between model performance and data quality. We propose Approximate Entropy (ApEn) to assess data quality, presenting a more nuanced approach compared to traditional data quantity metrics.
  arXiv  Detail & Related papers  (2024-11-30T10:56:30Z)
• Enhancing Graph Contrastive Learning with Reliable and Informative Augmentation for Recommendation [84.45144851024257]
  We propose a novel framework that aims to enhance graph contrastive learning by constructing contrastive views with stronger collaborative information via discrete codes. The core idea is to map users and items into discrete codes rich in collaborative information for reliable and informative contrastive view generation.
  arXiv  Detail & Related papers  (2024-09-09T14:04:17Z)
• Measuring the Predictability of Recommender Systems using Structural Complexity Metrics [0.6429591199690016]
  This study introduces data-driven metrics to measure the predictability of RS based on the structural complexity of the user-item rating matrix. A low predictability score indicates complex and unpredictable user-item interactions, while a high predictability score reveals less complex patterns with predictive potential.
  arXiv  Detail & Related papers  (2024-04-12T22:00:27Z)
• Subject-specific Deep Neural Networks for Count Data with High-cardinality Categorical Features [1.2289361708127877]
  We propose a novel hierarchical likelihood learning framework for introducing gamma random effects into a Poisson deep neural network. The proposed method simultaneously yields maximum likelihood estimators for fixed parameters and best unbiased predictors for random effects. State-of-the-art network architectures can be easily implemented into the proposed h-likelihood framework.
  arXiv  Detail & Related papers  (2023-10-18T01:54:48Z)
• 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)
• ARM-Net: Adaptive Relation Modeling Network for Structured Data [29.94433633729326]
  ARM-Net is an adaptive relation modeling network tailored for structured data and a lightweight framework ARMOR based on ARM-Net for relational data. We show that ARM-Net consistently outperforms existing models and provides more interpretable predictions for datasets.
  arXiv  Detail & Related papers  (2021-07-05T07:37:24Z)
• Adversarial Feature Augmentation and Normalization for Visual Recognition [109.6834687220478]
  Recent advances in computer vision take advantage of adversarial data augmentation to ameliorate the generalization ability of classification models. Here, we present an effective and efficient alternative that advocates adversarial augmentation on intermediate feature embeddings. We validate the proposed approach across diverse visual recognition tasks with representative backbone networks.
  arXiv  Detail & Related papers  (2021-03-22T20:36:34Z)
• Generative Counterfactuals for Neural Networks via Attribute-Informed Perturbation [51.29486247405601]
  We design a framework to generate counterfactuals for raw data instances with the proposed Attribute-Informed Perturbation (AIP) By utilizing generative models conditioned with different attributes, counterfactuals with desired labels can be obtained effectively and efficiently. Experimental results on real-world texts and images demonstrate the effectiveness, sample quality as well as efficiency of our designed framework.
  arXiv  Detail & Related papers  (2021-01-18T08:37:13Z)
• Neural Representations in Hybrid Recommender Systems: Prediction versus Regularization [8.384351067134999]
  We define the neural representation for prediction (NRP) framework and apply it to the autoencoder-based recommendation systems. We also apply the NRP framework to a direct neural network structure which predicts the ratings without reconstructing the user and item information. The results confirm that neural representations are better for prediction than regularization and show that the NRP framework, combined with the direct neural network structure, outperforms the state-of-the-art methods in the prediction task.
  arXiv  Detail & Related papers  (2020-10-12T23:12:49Z)
• Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach [115.76667128325361]
  Recommendation models can effectively estimate underlying user interests and predict one's future behaviors. We propose an inductive collaborative filtering framework that contains two representation models. Our model achieves promising results for recommendation on few-shot users with limited training ratings and new unseen users.
  arXiv  Detail & Related papers  (2020-07-09T14:31:25Z)

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.