Combining social relations and interaction data in Recommender System with Graph Convolution Collaborative Filtering

• URL: http://arxiv.org/abs/2506.02834v1
• Date: Tue, 03 Jun 2025 13:04:00 GMT
• Title: Combining social relations and interaction data in Recommender System with Graph Convolution Collaborative Filtering
• Authors: Tin T. Tran, Vaclav Snasel, Loc Tan Nguyen,
• Abstract summary: Similarity between users is an important impact for recommendation.<n>We present the input data processing method to remove outliers which are single reviews or users with little interaction with the items.<n>The next proposed model will combine the social relationship data and the similarity in the rating history of users to improve the accuracy and recall of the recommender system.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: A recommender system is an important subject in the field of data mining, where the item rating information from users is exploited and processed to make suitable recommendations with all other users. The recommender system creates convenience for e-commerce users and stimulates the consumption of items that are suitable for users. In addition to e-commerce, a recommender system is also used to provide recommendations on books to read, movies to watch, courses to take or websites to visit. Similarity between users is an important impact for recommendation, which could be calculated from the data of past user ratings of the item by methods of collaborative filtering, matrix factorization or singular vector decomposition. In the development of graph data mining techniques, the relationships between users and items can be represented by matrices from which collaborative filtering could be done with the larger database, more accurate and faster in calculation. All these data can be represented graphically and mined by today's highly developed graph neural network models. On the other hand, users' social friendship data also influence consumption habits because recommendations from friends will be considered more carefully than information sources. However, combining a user's friend influence and the similarity between users whose similar shopping habits is challenging. Because the information is noisy and it affects each particular data set in different ways. In this study, we present the input data processing method to remove outliers which are single reviews or users with little interaction with the items; the next proposed model will combine the social relationship data and the similarity in the rating history of users to improve the accuracy and recall of the recommender system.

Related papers

• ConsRec: Denoising Sequential Recommendation through User-Consistent Preference Modeling [33.281526528724335]
  We propose the User-Consistent Preference-based Sequential Recommendation System (ConsRec)<n>ConsRec captures stable user preferences and filters noisy items from interaction histories.<n>Results show ConsRec achieves a 13% improvement over baseline recommendation models.
  arXiv  Detail & Related papers  (2025-05-28T08:55:13Z)
• Dissertation: On the Theoretical Foundation of Model Comparison and Evaluation for Recommender System [4.76281731053599]
  Recommender systems utilize users' historical data to infer customer interests and provide personalized recommendations. Collaborative filtering is one family of recommendation algorithms that uses ratings from multiple users to predict missing ratings. Recommender systems can be more complex and incorporate auxiliary data such as content-based attributes, user interactions, and contextual information.
  arXiv  Detail & Related papers  (2024-11-04T06:31:52Z)
• EDGE-Rec: Efficient and Data-Guided Edge Diffusion For Recommender Systems Graphs [0.0]
  We propose a new attention mechanism to take advantage of real-valued interaction weights as well as user and item features directly. We train a novel Graph Diffusion Transformer GDiT architecture to iteratively denoise the weighted interaction matrix of the user-item interaction graph directly. Inspired by the recent progress in text-conditioned image generation, our method directly produces user-item rating predictions on the same scale as the original ratings.
  arXiv  Detail & Related papers  (2024-09-23T03:23:20Z)
• 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)
• 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)
• Dual Side Deep Context-aware Modulation for Social Recommendation [50.59008227281762]
  We propose a novel graph neural network to model the social relation and collaborative relation. On top of high-order relations, a dual side deep context-aware modulation is introduced to capture the friends' information and item attraction.
  arXiv  Detail & Related papers  (2021-03-16T11:08:30Z)
• Dynamic Graph Collaborative Filtering [64.87765663208927]
  Dynamic recommendation is essential for recommender systems to provide real-time predictions based on sequential data. Here we propose Dynamic Graph Collaborative Filtering (DGCF), a novel framework leveraging dynamic graphs to capture collaborative and sequential relations. Our approach achieves higher performance when the dataset contains less action repetition, indicating the effectiveness of integrating dynamic collaborative information.
  arXiv  Detail & Related papers  (2021-01-08T04:16:24Z)
• COOKIE: A Dataset for Conversational Recommendation over Knowledge Graphs in E-commerce [64.95907840457471]
  We present a new dataset for conversational recommendation over knowledge graphs in e-commerce platforms called COOKIE. The dataset is constructed from an Amazon review corpus by integrating both user-agent dialogue and custom knowledge graphs for recommendation.
  arXiv  Detail & Related papers  (2020-08-21T00:11:31Z)
• Presentation of a Recommender System with Ensemble Learning and Graph Embedding: A Case on MovieLens [3.8848561367220276]
  Group classification and the ensemble learning technique were used for increasing prediction accuracy in recommender systems. This study was performed on the MovieLens datasets, and the obtained results indicated the high efficiency of the presented method.
  arXiv  Detail & Related papers  (2020-07-15T12:52:15Z)
• Mining Implicit Entity Preference from User-Item Interaction Data for Knowledge Graph Completion via Adversarial Learning [82.46332224556257]
  We propose a novel adversarial learning approach by leveraging user interaction data for the Knowledge Graph Completion task. Our generator is isolated from user interaction data, and serves to improve the performance of the discriminator. To discover implicit entity preference of users, we design an elaborate collaborative learning algorithms based on graph neural networks.
  arXiv  Detail & Related papers  (2020-03-28T05:47:33Z)

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.