Pith. sign in

REVIEW 3 cited by

DynLLM: When Large Language Models Meet Dynamic Graph Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.07580 v1 pith:GXY3X3U6 submitted 2024-05-13 cs.IR cs.AI

classification cs.IRcs.AI
keywords graphdynamicdynllmllmsrecommendationembeddinglargetemporal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Last year has witnessed the considerable interest of Large Language Models (LLMs) for their potential applications in recommender systems, which may mitigate the persistent issue of data sparsity. Though large efforts have been made for user-item graph augmentation with better graph-based recommendation performance, they may fail to deal with the dynamic graph recommendation task, which involves both structural and temporal graph dynamics with inherent complexity in processing time-evolving data. To bridge this gap, in this paper, we propose a novel framework, called DynLLM, to deal with the dynamic graph recommendation task with LLMs. Specifically, DynLLM harnesses the power of LLMs to generate multi-faceted user profiles based on the rich textual features of historical purchase records, including crowd segments, personal interests, preferred categories, and favored brands, which in turn supplement and enrich the underlying relationships between users and items. Along this line, to fuse the multi-faceted profiles with temporal graph embedding, we engage LLMs to derive corresponding profile embeddings, and further employ a distilled attention mechanism to refine the LLM-generated profile embeddings for alleviating noisy signals, while also assessing and adjusting the relevance of each distilled facet embedding for seamless integration with temporal graph embedding from continuous time dynamic graphs (CTDGs). Extensive experiments on two real e-commerce datasets have validated the superior improvements of DynLLM over a wide range of state-of-the-art baseline methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Node-as-Agent: Graph Agentic Network

    cs.CL 2025-08 conditional novelty 6.0 of 10

    A node-as-agent framework where a frozen LLM plans each node's local and global message passing achieves competitive Cora accuracy without training, but uses per-dataset prompt selection and leaves label-leakage quest...

  2. Graph Foundation Models for Recommendation: A Comprehensive Survey

    cs.IR 2025-02 conditional novelty 4.0 of 10

    A comprehensive survey that categorizes graph foundation model approaches to recommendation into graph-augmented LLM, LLM-augmented graph, and LLM-graph harmonization.

  3. DKG-LLM : A Framework for Medical Diagnosis and Personalized Treatment Recommendations via Dynamic Knowledge Graph and Large Language Model Integration

    cs.CL 2025-08 reject novelty 3.0 of 10

    DKG-LLM claims to improve medical diagnosis and treatment recommendations by dynamically updating a knowledge graph with Grok 3, but its reported results are not backed by a reproducible experimental protocol.

Pith tools