SynGraph: A Dynamic Graph-LLM Synthesis Framework for Sparse Streaming User Sentiment Modeling

• URL: http://arxiv.org/abs/2503.04619v1
• Date: Thu, 06 Mar 2025 17:05:33 GMT
• Title: SynGraph: A Dynamic Graph-LLM Synthesis Framework for Sparse Streaming User Sentiment Modeling
• Authors: Xin Zhang, Qiyu Wei, Yingjie Zhu, Linhai Zhang, Deyu Zhou, Sophia Ananiadou,
• Abstract summary: User reviews on e-commerce platforms exhibit dynamic sentiment patterns driven by temporal and contextual factors.<n>Traditional sentiment analysis methods fail to capture the evolving temporal relationship between user sentiment rating and textual content.<n>We introduce SynGraph, a novel framework designed to address data sparsity in sentiment analysis on streaming reviews.
• Score: 33.73286491864817
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: User reviews on e-commerce platforms exhibit dynamic sentiment patterns driven by temporal and contextual factors. Traditional sentiment analysis methods focus on static reviews, failing to capture the evolving temporal relationship between user sentiment rating and textual content. Sentiment analysis on streaming reviews addresses this limitation by modeling and predicting the temporal evolution of user sentiments. However, it suffers from data sparsity, manifesting in temporal, spatial, and combined forms. In this paper, we introduce SynGraph, a novel framework designed to address data sparsity in sentiment analysis on streaming reviews. SynGraph alleviates data sparsity by categorizing users into mid-tail, long-tail, and extreme scenarios and incorporating LLM-augmented enhancements within a dynamic graph-based structure. Experiments on real-world datasets demonstrate its effectiveness in addressing sparsity and improving sentiment modeling in streaming reviews.

Related papers

• The Devil is in the Spurious Correlations: Boosting Moment Retrieval with Dynamic Learning [49.40254251698784]
  We propose a dynamic learning approach for moment retrieval, where two strategies are designed to mitigate the spurious correlation. First, we introduce a novel video synthesis approach to construct a dynamic context for the queried moment. Second, to alleviate the over-association with backgrounds, we enhance representations temporally by incorporating text-dynamics interaction.
  arXiv  Detail & Related papers  (2025-01-13T13:13:06Z)
• Retrieval Augmented Generation for Dynamic Graph Modeling [15.09162213134372]
  We propose a novel framework, Retrieval-Augmented Generation for Dynamic Graph modeling (RAG4DyG) RAG4DyG enhances dynamic graph predictions by incorporating contextually and temporally relevant examples from broader graph structures. The proposed framework is designed to be effective in both transductive and inductive scenarios.
  arXiv  Detail & Related papers  (2024-08-26T09:23:35Z)
• Relational Graph Convolutional Networks for Sentiment Analysis [0.0]
  Graph Convolutional Networks (NRGCs) offer interpretability and flexibility by capturing dependencies between data points represented as nodes in a graph. We demonstrate the effectiveness of our approach by using pre-trained language models such as BERT and RoBERTa with RGCN architecture on product reviews from Amazon and Digikala datasets.
  arXiv  Detail & Related papers  (2024-04-16T07:27:49Z)
• TimeGraphs: Graph-based Temporal Reasoning [64.18083371645956]
  TimeGraphs is a novel approach that characterizes dynamic interactions as a hierarchical temporal graph. Our approach models the interactions using a compact graph-based representation, enabling adaptive reasoning across diverse time scales. We evaluate TimeGraphs on multiple datasets with complex, dynamic agent interactions, including a football simulator, the Resistance game, and the MOMA human activity dataset.
  arXiv  Detail & Related papers  (2024-01-06T06:26:49Z)
• EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning [92.71579608528907]
  This paper aims to design an easy-to-use pipeline (termed as EasyDGL) composed of three key modules with both strong ability fitting and interpretability. EasyDGL can effectively quantify the predictive power of frequency content that a model learn from the evolving graph data.
  arXiv  Detail & Related papers  (2023-03-22T06:35:08Z)
• FactGraph: Evaluating Factuality in Summarization with Semantic Graph Representations [114.94628499698096]
  We propose FactGraph, a method that decomposes the document and the summary into structured meaning representations (MRs) MRs describe core semantic concepts and their relations, aggregating the main content in both document and summary in a canonical form, and reducing data sparsity. Experiments on different benchmarks for evaluating factuality show that FactGraph outperforms previous approaches by up to 15%.
  arXiv  Detail & Related papers  (2022-04-13T16:45:33Z)
• Dynamic Graph Echo State Networks [11.900741510492754]
  We propose an extension of graph echo state networks for efficient processing of dynamic temporal graphs. Our model provides a vector encoding for the dynamic graph that is updated at each time-step without requiring training. Experiments show accuracy comparable to approximate temporal graph kernels on twelve dissemination process classification tasks.
  arXiv  Detail & Related papers  (2021-10-16T12:51:50Z)
• Exploring and mining attributed sequences of interactions [0.1933681537640272]
  We model interactions as stream graphs, a recent framework to model interactions over time. We introduce algorithms to enumerate closed patterns on a labeled stream graph, and introduce a way to select relevant closed patterns. We run experiments on two real-world datasets of interactions among students and citations between authors.
  arXiv  Detail & Related papers  (2021-07-28T12:53:46Z)
• TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning [87.38675639186405]
  We propose a novel graph neural network approach, called TCL, which deals with the dynamically-evolving graph in a continuous-time fashion. To the best of our knowledge, this is the first attempt to apply contrastive learning to representation learning on dynamic graphs.
  arXiv  Detail & Related papers  (2021-05-17T15:33:25Z)
• Catastrophic Forgetting in Deep Graph Networks: an Introductory Benchmark for Graph Classification [12.423303337249795]
  We study the phenomenon of catastrophic forgetting in the graph representation learning scenario. We find that replay is the most effective strategy in so far, which also benefits the most from the use of regularization.
  arXiv  Detail & Related papers  (2021-03-22T12:07:21Z)
• Jointly Modeling Aspect and Sentiment with Dynamic Heterogeneous Graph Neural Networks [27.59070337052869]
  Target-Based Sentiment Analysis aims to detect the opinion aspects (aspect extraction) and the sentiment polarities (sentiment detection) towards them. Both the previous pipeline and integrated methods fail to precisely model the innate connection between these two objectives. We propose a novel dynamic heterogeneous graph to jointly model the two objectives in an explicit way.
  arXiv  Detail & Related papers  (2020-04-14T11:27:30Z)

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.