A Soft Recommender System for Social Networks
- URL: http://arxiv.org/abs/2001.02520v1
- Date: Wed, 8 Jan 2020 13:38:09 GMT
- Title: A Soft Recommender System for Social Networks
- Authors: Marzieh Pourhojjati-Sabet and Azam Rabiee
- Abstract summary: Recent social recommender systems benefit from friendship graph to make an accurate recommendation.
We went a step further to identify true friends for making even more realistic recommendations.
We calculated the similarity between users, as well as the dependency between a user and an item.
- Score: 1.8275108630751844
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Recent social recommender systems benefit from friendship graph to make an
accurate recommendation, believing that friends in a social network have
exactly the same interests and preferences. Some studies have benefited from
hard clustering algorithms (such as K-means) to determine the similarity
between users and consequently to define degree of friendships. In this paper,
we went a step further to identify true friends for making even more realistic
recommendations. we calculated the similarity between users, as well as the
dependency between a user and an item. Our hypothesis is that due to the
uncertainties in user preferences, the fuzzy clustering, instead of the
classical hard clustering, is beneficial in accurate recommendations. We
incorporated the C-means algorithm to get different membership degrees of soft
users' clusters. Then, the users' similarity metric is defined according to the
soft clusters. Later, in a training scheme we determined the latent
representations of users and items, extracting from the huge and sparse
user-item-tag matrix using matrix factorization. In the parameter tuning, we
found the optimum coefficients for the influence of our soft social
regularization and the user-item dependency terms. Our experimental results
convinced that the proposed fuzzy similarity metric improves the
recommendations in real data compared to the baseline social recommender system
with the hard clustering.
Related papers
- Quantifying User Coherence: A Unified Framework for Cross-Domain Recommendation Analysis [69.37718774071793]
This paper introduces novel information-theoretic measures for understanding recommender systems.
We evaluate 7 recommendation algorithms across 9 datasets, revealing the relationships between our measures and standard performance metrics.
arXiv Detail & Related papers (2024-10-03T13:02:07Z) - Algorithmic Drift: A Simulation Framework to Study the Effects of Recommender Systems on User Preferences [7.552217586057245]
We propose a simulation framework that mimics user-recommender system interactions in a long-term scenario.
We introduce two novel metrics for quantifying the algorithm's impact on user preferences, specifically in terms of drift over time.
arXiv Detail & Related papers (2024-09-24T21:54:22Z) - Retrieval Augmentation via User Interest Clustering [57.63883506013693]
Industrial recommender systems are sensitive to the patterns of user-item engagement.
We propose a novel approach that efficiently constructs user interest and facilitates low computational cost inference.
Our approach has been deployed in multiple products at Meta, facilitating short-form video related recommendation.
arXiv Detail & Related papers (2024-08-07T16:35:10Z) - End-to-end Learnable Clustering for Intent Learning in Recommendation [54.157784572994316]
We propose a novel intent learning method termed underlineELCRec.
It unifies behavior representation learning into an underlineEnd-to-end underlineLearnable underlineClustering framework.
We deploy this method on the industrial recommendation system with 130 million page views and achieve promising results.
arXiv Detail & Related papers (2024-01-11T15:22:55Z) - ClusterSeq: Enhancing Sequential Recommender Systems with Clustering
based Meta-Learning [3.168790535780547]
ClusterSeq is a Meta-Learning Clustering-Based Sequential Recommender System.
It exploits dynamic information in the user sequence to enhance item prediction accuracy, even in the absence of side information.
Our proposed approach achieves a substantial improvement of 16-39% in Mean Reciprocal Rank (MRR)
arXiv Detail & Related papers (2023-07-25T18:53:24Z) - Graph Collaborative Signals Denoising and Augmentation for
Recommendation [75.25320844036574]
We propose a new graph adjacency matrix that incorporates user-user and item-item correlations.
We show that the inclusion of user-user and item-item correlations can improve recommendations for users with both abundant and insufficient interactions.
arXiv Detail & Related papers (2023-04-06T19:43:37Z) - Understanding or Manipulation: Rethinking Online Performance Gains of
Modern Recommender Systems [38.75457258877731]
We present a framework for benchmarking the degree of manipulations of recommendation algorithms.
We find that a high online click-through rate does not necessarily mean a better understanding of user initial preference.
We advocate that future recommendation algorithm studies should be treated as an optimization problem with constrained user preference manipulations.
arXiv Detail & Related papers (2022-10-11T17:56:55Z) - 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) - 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) - Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise
Comparisons [85.5955376526419]
In rank aggregation problems, users exhibit various accuracy levels when comparing pairs of items.
We propose an elimination-based active sampling strategy, which estimates the ranking of items via noisy pairwise comparisons.
We prove that our algorithm can return the true ranking of items with high probability.
arXiv Detail & Related papers (2021-10-08T13:51:55Z)
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.