A Recommendation Approach based on Similarity-Popularity Models of Complex Networks

• URL: http://arxiv.org/abs/2210.07816v1
• Date: Thu, 29 Sep 2022 11:00:06 GMT
• Title: A Recommendation Approach based on Similarity-Popularity Models of Complex Networks
• Authors: Abdullah Alhadlaq, Said Kerrache, Hatim Aboalsamh
• Abstract summary: This work proposes a novel recommendation method based on complex networks generated by a similarity-popularity model to predict ones. We first construct a model of a network having users and items as nodes from observed ratings and then use it to predict unseen ratings. The proposed approach is implemented and experimentally compared against baseline and state-of-the-art recommendation methods on 21 datasets from various domains.
• Score: 1.385805101975528
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender systems have become an essential tool for providers and users of online services and goods, especially with the increased use of the Internet to access information and purchase products and services. This work proposes a novel recommendation method based on complex networks generated by a similarity-popularity model to predict ones. We first construct a model of a network having users and items as nodes from observed ratings and then use it to predict unseen ratings. The prospect of producing accurate rating predictions using a similarity-popularity model with hidden metric spaces and dot-product similarity is explored. The proposed approach is implemented and experimentally compared against baseline and state-of-the-art recommendation methods on 21 datasets from various domains. The experimental results demonstrate that the proposed method produces accurate predictions and outperforms existing methods. We also show that the proposed approach produces superior results in low dimensions, proving its effectiveness for data visualization and exploration.

Related papers

• Neural Collaborative Filtering Classification Model to Obtain Prediction Reliabilities [0.9749638953163389]
  This paper proposes the use of a classification-based approach, returning both rating predictions and their reliabilities. This paper provides the proposed neural architecture; it also tests that the quality of its recommendation results is as good as the state of art baselines.
  arXiv  Detail & Related papers  (2024-10-22T09:17:05Z)
• Opinion mining using Double Channel CNN for Recommender System [0.0]
  We present an approach for sentiment analysis with a deep learning model and use it to recommend products. A two-channel convolutional neural network model has been used for opinion mining, which has five layers and extracts essential features from the data. Our proposed method has reached 91.6% accuracy, significantly improved compared to previous aspect-based approaches.
  arXiv  Detail & Related papers  (2023-07-15T13:11:18Z)
• Exploring validation metrics for offline model-based optimisation with diffusion models [50.404829846182764]
  In model-based optimisation (MBO) we are interested in using machine learning to design candidates that maximise some measure of reward with respect to a black box function called the (ground truth) oracle. While an approximation to the ground oracle can be trained and used in place of it during model validation to measure the mean reward over generated candidates, the evaluation is approximate and vulnerable to adversarial examples. This is encapsulated under our proposed evaluation framework which is also designed to measure extrapolation.
  arXiv  Detail & Related papers  (2022-11-19T16:57:37Z)
• Off-policy evaluation for learning-to-rank via interpolating the item-position model and the position-based model [83.83064559894989]
  A critical need for industrial recommender systems is the ability to evaluate recommendation policies offline, before deploying them to production. We develop a new estimator that mitigates the problems of the two most popular off-policy estimators for rankings. In particular, the new estimator, called INTERPOL, addresses the bias of a potentially misspecified position-based model.
  arXiv  Detail & Related papers  (2022-10-15T17:22:30Z)
• A Sequence-Aware Recommendation Method Based on Complex Networks [1.385805101975528]
  We build a network model from data and then use it to predict the user's subsequent actions. The proposed method is implemented and tested experimentally on a large dataset.
  arXiv  Detail & Related papers  (2022-09-30T16:34:39Z)
• 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)
• Application of Machine Learning for Online Reputation Systems [0.4125187280299248]
  This paper proposes a new reputation system using machine learning to predict reliability of consumers from consumer profile. The proposed model has been evaluated over three MovieLens benchmarking datasets, using 10-Folds cross validation.
  arXiv  Detail & Related papers  (2022-09-10T12:31:40Z)
• GHRS: Graph-based Hybrid Recommendation System with Application to Movie Recommendation [0.0]
  We propose a recommender system method using a graph-based model associated with the similarity of users' ratings. By utilizing the advantages of Autoencoder feature extraction, we extract new features based on all combined attributes. The experimental results on the MovieLens dataset show that the proposed algorithm outperforms many existing recommendation algorithms on recommendation accuracy.
  arXiv  Detail & Related papers  (2021-11-06T10:47:45Z)
• A Survey on Neural Recommendation: From Collaborative Filtering to Content and Context Enriched Recommendation [70.69134448863483]
  Research in recommendation has shifted to inventing new recommender models based on neural networks. In recent years, we have witnessed significant progress in developing neural recommender models.
  arXiv  Detail & Related papers  (2021-04-27T08:03:52Z)
• S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximization [104.87483578308526]
  We propose the model S3-Rec, which stands for Self-Supervised learning for Sequential Recommendation. For our task, we devise four auxiliary self-supervised objectives to learn the correlations among attribute, item, subsequence, and sequence. Extensive experiments conducted on six real-world datasets demonstrate the superiority of our proposed method over existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-18T11:44:10Z)
• Latent Unexpected Recommendations [89.2011481379093]
  We propose to model unexpectedness in the latent space of user and item embeddings, which allows to capture hidden and complex relations between new recommendations and historic purchases. In addition, we develop a novel Latent Closure (LC) method to construct hybrid utility function and provide unexpected recommendations based on the proposed model.
  arXiv  Detail & Related papers  (2020-07-27T02:39:30Z)

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.