mlsanityData to 14 Oct 2026

Towards Bridging Review Sparsity in Recommendation with Textual Edge Graph Representation

arXiv 2508.01128 ↗First posted 2 Aug 2025cs.IR cs.AI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Textual reviews enrich recommender systems with fine-grained preference signals and enhanced explainability. However, in real-world scenarios, users rarely leave reviews, resulting in severe sparsity that undermines the effectiveness of existing models. A natural solution is to impute or generate missing reviews to enrich the data. However, conventional imputation techniques -- such as matrix completion and LLM-based augmentation -- either lose contextualized semantics by embedding texts into vectors, or overlook structural dependencies among user-item interactions. To address these shortcomings, we propose TWISTER (ToWards Imputation on Sparsity with Textual Edge Graph Representation), a unified framework that imputes missing reviews by jointly modeling semantic and structural signals. Specifically, we represent user-item interactions as a Textual-Edge Graph (TEG), treating reviews as edge attributes. To capture relational context, we construct line-graph views and employ a large language model as a graph-aware aggregator. For each interaction lacking a textual review, our model aggregates the neighborhood's natural-language representations to generate a coherent and personalized review. Experiments on the Amazon and Goodreads datasets show that TWISTER consistently outperforms traditional numeric, graph-based, and LLM baselines, delivering higher-quality imputed reviews and, more importantly, enhanced recommendation performance. In summary, TWISTER generates reviews that are more helpful, authentic, and specific, while smoothing structural signals for improved recommendations.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 59 references that are in the map. First posted on arXiv 2 Aug 2025.

Builds on

26 of 59 references.

References · 26

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,512
  3. 2016Variational Graph Auto-Encoderscited by 1,382
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  5. 2019Neural Graph Collaborative Filteringcited by 661
  6. 2018GAIN: Missing Data Imputation using Generative Adversarial Netscited by 352
  7. 2023Text Embeddings Reveal (Almost) As Much As Textcited by 192
  8. 2020Handling Missing Data with Graph Representation Learningcited by 133
  9. 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
  10. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
  11. 2019Fine-Grained Spoiler Detection from Large-Scale Review Corporacited by 77
  12. 2024A Survey on Data Augmentation in Large Model Eracited by 31
14 more
  1. 2024Data Augmentation using Large Language Models: Data Perspectives, Learning Paradigms and Challengescited by 30
  2. 2023Edgeformers: Graph-Empowered Transformers for Representation Learning on Textual-Edge Networkscited by 23
  3. 2021Disentangling Semantics and Syntax in Sentence Embeddings with Pre-trained Language Modelscited by 22
  4. 2015Tensor Factorization via Matrix Factorizationcited by 15
  5. 2020Action Sequence Augmentation for Early Graph-based Anomaly Detectioncited by 15
  6. 2021WGCN: Graph Convolutional Networks with Weighted Structural Featurescited by 12
  7. 2024Large Language Model with Graph Convolution for Recommendationcited by 10
  8. 2025Position: Text Embeddings Should Capture Implicit Semantics, Not Just Surface Meaningcited by 10
  9. 2021Identifying Helpful Sentences in Product Reviewscited by 9
  10. 2024TEG-DB: A Comprehensive Dataset and Benchmark of Textual-Edge Graphscited by 9
  11. 2023Shilling Black-box Review-based Recommender Systems through Fake Review Generationcited by 8
  12. 2020Establishing strong imputation performance of a denoising autoencoder in a wide range of missing data problemscited by 6
  13. 2017Bias-Variance Tradeoff of Graph Laplacian Regularizercited by 4
  14. 2024Link Prediction on Textual Edge Graphscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.