Sentiment Analysis of Yelp Reviews: A Comparison of Techniques and Models

• URL: http://arxiv.org/abs/2004.13851v1
• Date: Wed, 15 Apr 2020 18:50:49 GMT
• Title: Sentiment Analysis of Yelp Reviews: A Comparison of Techniques and Models
• Abstract summary: We use over 350,000 Yelp reviews on 5,000 restaurants to perform an ablation study on text preprocessing techniques. For machine learning models, we find that using binary bag-of-word representation, adding bi-grams, imposing minimum frequency constraints and normalizing texts have positive effects on model performance. For deep learning models, we find that using pre-trained word embeddings and capping maximum length often boost model performance.
• Score: 15.37212212881138
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We use over 350,000 Yelp reviews on 5,000 restaurants to perform an ablation study on text preprocessing techniques. We also compare the effectiveness of several machine learning and deep learning models on predicting user sentiment (negative, neutral, or positive). For machine learning models, we find that using binary bag-of-word representation, adding bi-grams, imposing minimum frequency constraints and normalizing texts have positive effects on model performance. For deep learning models, we find that using pre-trained word embeddings and capping maximum length often boost model performance. Finally, using macro F1 score as our comparison metric, we find simpler models such as Logistic Regression and Support Vector Machine to be more effective at predicting sentiments than more complex models such as Gradient Boosting, LSTM and BERT.

Related papers

• Empirical Comparison of Encoder-Based Language Models and Feature-Based Supervised Machine Learning Approaches to Automated Scoring of Long Essays [8.899249868081956]
  Long context may impose challenges for encoder-only language models in text processing.<n>This study trained several commonly used encoder-based language models for automated scoring of long essays.
  arXiv  Detail & Related papers  (2026-01-06T02:17:45Z)
• VERBA: Verbalizing Model Differences Using Large Language Models [3.2771631221674333]
  We introduce $textbfVERBA$ to generate verbalizations of model differences by sampling from two models.<n>For a pair of decision tree models with up to 5% performance difference but 20-25% behavioral differences, $textbfVERBA$ effectively verbalizes their variations with up to 80% overall accuracy.
  arXiv  Detail & Related papers  (2025-07-03T02:25:24Z)
• SPaR: Self-Play with Tree-Search Refinement to Improve Instruction-Following in Large Language Models [88.29990536278167]
  We introduce SPaR, a self-play framework integrating tree-search self-refinement to yield valid and comparable preference pairs. Our experiments show that a LLaMA3-8B model, trained over three iterations guided by SPaR, surpasses GPT-4-Turbo on the IFEval benchmark without losing general capabilities.
  arXiv  Detail & Related papers  (2024-12-16T09:47:43Z)
• Attribute-to-Delete: Machine Unlearning via Datamodel Matching [65.13151619119782]
  Machine unlearning -- efficiently removing a small "forget set" training data on a pre-divertrained machine learning model -- has recently attracted interest. Recent research shows that machine unlearning techniques do not hold up in such a challenging setting.
  arXiv  Detail & Related papers  (2024-10-30T17:20:10Z)
• Comparing effectiveness of regularization methods on text classification: Simple and complex model in data shortage situation [0.8848340429852071]
  We study the regularization methods' effects on various classification models when only a few labeled data are available. We compare a simple word embedding-based model, which is simple but effective, with complex models. We evaluate the regularization effects on four text classification datasets.
  arXiv  Detail & Related papers  (2024-02-27T07:26:16Z)
• Improving Classification Performance With Human Feedback: Label a few, we label the rest [2.7386128680964408]
  This paper focuses on understanding how a continuous feedback loop can refine models, thereby enhancing their accuracy, recall, and precision. We benchmark this approach on the Financial Phrasebank, Banking, Craigslist, Trec, Amazon Reviews datasets to prove that with just a few labeled examples, we are able to surpass the accuracy of zero shot large language models.
  arXiv  Detail & Related papers  (2024-01-17T19:13:05Z)
• The Languini Kitchen: Enabling Language Modelling Research at Different Scales of Compute [66.84421705029624]
  We introduce an experimental protocol that enables model comparisons based on equivalent compute, measured in accelerator hours. We pre-process an existing large, diverse, and high-quality dataset of books that surpasses existing academic benchmarks in quality, diversity, and document length. This work also provides two baseline models: a feed-forward model derived from the GPT-2 architecture and a recurrent model in the form of a novel LSTM with ten-fold throughput.
  arXiv  Detail & Related papers  (2023-09-20T10:31:17Z)
• Direct and inverse modeling of soft robots by learning a condensed FEM model [3.4696964555947694]
  We propose a learning-based approach to obtain a compact but sufficiently rich mechanical representation. We show how to couple some models learned individually in particular on an example of a gripper composed of two soft fingers. This work opens new perspectives, namely for the embedded control of soft robots, but also for their design.
  arXiv  Detail & Related papers  (2023-07-21T08:07:16Z)
• Empirical evaluation of shallow and deep learning classifiers for Arabic sentiment analysis [1.1172382217477126]
  This work presents a detailed comparison of the performance of deep learning models for sentiment analysis of Arabic reviews. The datasets used in this study are multi-dialect Arabic hotel and book review datasets, which are some of the largest publicly available datasets for Arabic reviews. Results showed deep learning outperforming shallow learning for binary and multi-label classification, in contrast with the results of similar work reported in the literature.
  arXiv  Detail & Related papers  (2021-12-01T14:45:43Z)
• Sparse MoEs meet Efficient Ensembles [49.313497379189315]
  We study the interplay of two popular classes of such models: ensembles of neural networks and sparse mixture of experts (sparse MoEs) We present Efficient Ensemble of Experts (E$3$), a scalable and simple ensemble of sparse MoEs that takes the best of both classes of models, while using up to 45% fewer FLOPs than a deep ensemble.
  arXiv  Detail & Related papers  (2021-10-07T11:58:35Z)
• Multiple Run Ensemble Learning withLow-Dimensional Knowledge Graph Embeddings [4.317340121054659]
  We propose a simple but effective performance boosting strategy for knowledge graph embedding (KGE) models. We repeat the training of a model 6 times in parallel with an embedding size of 200 and then combine the 6 separate models for testing. We show that our approach enables different models to better cope with their issues on modeling various graph patterns.
  arXiv  Detail & Related papers  (2021-04-11T12:26:50Z)
• ALT-MAS: A Data-Efficient Framework for Active Testing of Machine Learning Algorithms [58.684954492439424]
  We propose a novel framework to efficiently test a machine learning model using only a small amount of labeled test data. The idea is to estimate the metrics of interest for a model-under-test using Bayesian neural network (BNN)
  arXiv  Detail & Related papers  (2021-04-11T12:14:04Z)
• Few-shot learning through contextual data augmentation [74.20290390065475]
  Machine translation models need to adapt to new data to maintain their performance over time. We show that adaptation on the scale of one to five examples is possible. Our model reports better accuracy scores than a reference system trained with on average 313 parallel examples.
  arXiv  Detail & Related papers  (2021-03-31T09:05:43Z)
• TERA: Self-Supervised Learning of Transformer Encoder Representation for Speech [63.03318307254081]
  TERA stands for Transformer Representations from Alteration. We use alteration along three axes to pre-train Transformers on a large amount of unlabeled speech. TERA can be used for speech representations extraction or fine-tuning with downstream models.
  arXiv  Detail & Related papers  (2020-07-12T16:19:00Z)

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.