mlsanityData to 7 Oct 2026

Uncovering Customer Issues through Topological Natural Language Analysis

arXiv 2403.00804 ↗First posted 24 Feb 2024cs.CL cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

E-commerce companies deal with a high volume of customer service requests daily. While a simple annotation system is often used to summarize the topics of customer contacts, thoroughly exploring each specific issue can be challenging. This presents a critical concern, especially during an emerging outbreak where companies must quickly identify and address specific issues. To tackle this challenge, we propose a novel machine learning algorithm that leverages natural language techniques and topological data analysis to monitor emerging and trending customer issues. Our approach involves an end-to-end deep learning framework that simultaneously tags the primary question sentence of each customer's transcript and generates sentence embedding vectors. We then whiten the embedding vectors and use them to construct an undirected graph. From there, we define trending and emerging issues based on the topological properties of each transcript. We have validated our results through various methods and found that they are highly consistent with news sources.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 16 references that are in the map. First posted on arXiv 24 Feb 2024.

Builds on

6 of 16 references.

References · 6

  1. 2017Attention Is All You Needcited by 59,932
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  4. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  5. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 809
  6. 2021Whitening Sentence Representations for Better Semantics and Faster Retrievalcited by 198

Built on by

Cited by year (2026 to 7 Oct)

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

2 papers.