mlsanityData to 14 Oct 2026

Influence of various text embeddings on clustering performance in NLP

arXiv 2305.03144 ↗First posted 4 May 2023cs.LG cs.CL cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

With the advent of e-commerce platforms, reviews are crucial for customers to assess the credibility of a product. The star ratings do not always match the review text written by the customer. For example, a three star rating (out of five) may be incongruous with the review text, which may be more suitable for a five star review. A clustering approach can be used to relabel the correct star ratings by grouping the text reviews into individual groups. In this work, we explore the task of choosing different text embeddings to represent these reviews and also explore the impact the embedding choice has on the performance of various classes of clustering algorithms. We use contextual (BERT) and non-contextual (Word2Vec) text embeddings to represent the text and measure their impact of three classes on clustering algorithms - partitioning based (KMeans), single linkage agglomerative hierarchical, and density based (DBSCAN and HDBSCAN), each with various experimental settings. We use the silhouette score, adjusted rand index score, and cluster purity score metrics to evaluate the performance of the algorithms and discuss the impact of different embeddings on the clustering performance. Our results indicate that the type of embedding chosen drastically affects the performance of the algorithm, the performance varies greatly across different types of clustering algorithms, no embedding type is better than the other, and DBSCAN outperforms KMeans and single linkage agglomerative clustering but also labels more data points as outliers. We provide a thorough comparison of the performances of different algorithms and provide numerous ideas to foster further research in the domain of text clustering.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 4 May 2023.

Builds on

4 of 21 references.

References · 4

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  3. 2022Stop using the elbow criterion for k-means and how to choose the number of clusters insteadcited by 25
  4. 2021A review of systematic selection of clustering algorithms and their evaluationcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.