Given Users Recommendations Based on Reviews on Yelp

• URL: http://arxiv.org/abs/2112.01762v1
• Date: Fri, 3 Dec 2021 07:42:45 GMT
• Title: Given Users Recommendations Based on Reviews on Yelp
• Authors: Shuwei Zhang, Maiqi Tang, Qingyang Zhang, Yucan Luo, Yuhui Zou
• Abstract summary: In our project, we focus on NLP-based hybrid recommendation systems. We have two major components: the first part is to embed the reviews with the Bert model and word2vec model. The second part is the implementation of an item-based collaborative filtering to compute the similarity of each review under different categories of restaurants.
• Score: 0.8504685056067139
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In our project, we focus on NLP-based hybrid recommendation systems. Our data is from Yelp Data. For our hybrid recommendation system, we have two major components: the first part is to embed the reviews with the Bert model and word2vec model; the second part is the implementation of an item-based collaborative filtering algorithm to compute the similarity of each review under different categories of restaurants. In the end, with the help of similarity scores, we are able to recommend users the most matched restaurant based on their recorded reviews. The coding work is split into several parts: selecting samples and data cleaning, processing, embedding, computing similarity, and computing prediction and error. Due to the size of the data, each part will generate one or more JSON files as the milestone to reduce the pressure on memory and the communication between each part.

Related papers

• Combining social relations and interaction data in Recommender System with Graph Convolution Collaborative Filtering [0.0]
  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.
  arXiv  Detail & Related papers  (2025-06-03T13:04:00Z)
• FedCIA: Federated Collaborative Information Aggregation for Privacy-Preserving Recommendation [28.8047308546416]
  We introduce the federated collaborative information aggregation (FedCIA) method for privacy-preserving recommendation. FedCIA allows clients to align their local models without constraining embeddings to a unified vector space. It mitigates information loss caused by direct summation, preserves the personalized embedding distributions of individual clients, and supports the aggregation of parameter-free models.
  arXiv  Detail & Related papers  (2025-04-19T06:59:34Z)
• Can Large Language Models Understand Preferences in Personalized Recommendation? [32.2250928311146]
  We introduce PerRecBench, disassociating evaluation from user rating bias and item quality. We find that the LLM-based recommendation techniques that are generally good at rating prediction fail to identify users' favored and disfavored items when the user rating bias and item quality are eliminated. Our findings reveal the superiority of pairwise and listwise ranking approaches over pointwise ranking, PerRecBench's low correlation with traditional regression metrics, the importance of user profiles, and the role of pretraining data distributions.
  arXiv  Detail & Related papers  (2025-01-23T05:24:18Z)
• Personalized Federated Collaborative Filtering: A Variational AutoEncoder Approach [49.63614966954833]
  Federated Collaborative Filtering (FedCF) is an emerging field focused on developing a new recommendation framework with preserving privacy. Existing FedCF methods typically combine distributed Collaborative Filtering (CF) algorithms with privacy-preserving mechanisms, and then preserve personalized information into a user embedding vector. This paper proposes a novel personalized FedCF method by preserving users' personalized information into a latent variable and a neural model simultaneously.
  arXiv  Detail & Related papers  (2024-08-16T05:49:14Z)
• Our Model Achieves Excellent Performance on MovieLens: What Does it Mean? [43.3971105361606]
  We conduct a meticulous analysis of the MovieLens dataset. There are significant differences in user interactions at the different stages when a user interacts with the MovieLens platform. We discuss the discrepancy between the interaction generation mechanism that is employed by the MovieLens system and that of typical real-world recommendation scenarios.
  arXiv  Detail & Related papers  (2023-07-19T13:44:32Z)
• 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)
• When Search Meets Recommendation: Learning Disentangled Search Representation for Recommendation [56.98380787425388]
  We propose a search-Enhanced framework for the Sequential Recommendation (SESRec) SESRec disentangling similar and dissimilar representations within S&R behaviors. Experiments on both industrial and public datasets demonstrate that SESRec consistently outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2023-05-18T09:04:50Z)
• Towards Personalized Review Summarization by Modeling Historical Reviews from Customer and Product Separately [59.61932899841944]
  Review summarization is a non-trivial task that aims to summarize the main idea of the product review in the E-commerce website. We propose the Heterogeneous Historical Review aware Review Summarization Model (HHRRS) We employ a multi-task framework that conducts the review sentiment classification and summarization jointly.
  arXiv  Detail & Related papers  (2023-01-27T12:32:55Z)
• PEPPER: Empowering User-Centric Recommender Systems over Gossip Learning [0.0]
  PEPPER is a decentralized recommender system based on gossip learning principles. Our solution converges up to 42% faster than with other decentralized solutions.
  arXiv  Detail & Related papers  (2022-08-09T14:51:27Z)
• Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
  We show how to return a set of items rigorously guaranteed to contain mostly good items. Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate. We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
  arXiv  Detail & Related papers  (2022-07-04T17:49:25Z)
• Integrating Rankings into Quantized Scores in Peer Review [61.27794774537103]
  In peer review, reviewers are usually asked to provide scores for the papers. To mitigate this issue, conferences have started to ask reviewers to additionally provide a ranking of the papers they have reviewed. There are no standard procedure for using this ranking information and Area Chairs may use it in different ways. We take a principled approach to integrate the ranking information into the scores.
  arXiv  Detail & Related papers  (2022-04-05T19:39:13Z)
• Consistent Collaborative Filtering via Tensor Decomposition [0.2578242050187029]
  Collaborative filtering is the de facto standard for analyzing users' activities and building recommendation systems for items. We develop Sliced Anti-symmetric Decomposition (SAD), a new model for collaborative filtering based on implicit feedback. We demonstrate the efficiency of SAD in both simulated and real world datasets containing over 1M user-item interactions.
  arXiv  Detail & Related papers  (2022-01-28T05:14:37Z)
• Learning to Match Jobs with Resumes from Sparse Interaction Data using Multi-View Co-Teaching Network [83.64416937454801]
  Job-resume interaction data is sparse and noisy, which affects the performance of job-resume match algorithms. We propose a novel multi-view co-teaching network from sparse interaction data for job-resume matching. Our model is able to outperform state-of-the-art methods for job-resume matching.
  arXiv  Detail & Related papers  (2020-09-25T03:09:54Z)
• Controllable Multi-Interest Framework for Recommendation [64.30030600415654]
  We formalize the recommender system as a sequential recommendation problem. We propose a novel controllable multi-interest framework for the sequential recommendation, called ComiRec. Our framework has been successfully deployed on the offline Alibaba distributed cloud platform.
  arXiv  Detail & Related papers  (2020-05-19T10:18:43Z)
• A Hybrid Approach to Enhance Pure Collaborative Filtering based on Content Feature Relationship [0.17188280334580192]
  We introduce a novel method to extract the implicit relationship between content features using a sort of well-known methods from the natural language processing domain, namely Word2Vec. Next, we propose a novel content-based recommendation system that employs the relationship to determine vector representations for items. Our evaluation results demonstrate that it can predict the preference a user would have for a set of items as good as pure collaborative filtering.
  arXiv  Detail & Related papers  (2020-05-17T02:20:45Z)

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.