Beyond Interactions: Node-Level Graph Generation for Knowledge-Free Augmentation in Recommender Systems
Recent advances in recommender systems rely on external resources such as knowledge graphs or large language models to enhance recommendations, which limit applicability in real-world settings due to data dependency and computational overhead. Although knowledge-free models are able to bolster recommendations by direct edge operations as well, the absence of augmentation primitives drives them to fall short in bridging semantic and structural gaps as high-quality paradigm substitutes. Unlike existing diffusion-based works that remodel user-item interactions, this work proposes NodeDiffRec, a pioneering knowledge-free augmentation framework that enables fine-grained node-level graph generation for recommendations and expands the scope of restricted augmentation primitives via diffusion. By synthesizing pseudo-items and corresponding interactions that align with the underlying distribution for injection, and further refining user preferences through a denoising preference modeling process, NodeDiffRec dramatically enhances both semantic diversity and structural connectivity without external knowledge. Extensive experiments across diverse datasets and recommendation algorithms demonstrate the superiority of NodeDiffRec, achieving State-of-the-Art (SOTA) performance, with maximum average performance improvement 98.6% in Recall@5 and 84.0% in NDCG@5 over selected baselines.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph GenerationKnowledge GraphsSimilar Papers 제목 키워드 기반
Graph Transformer GANs for Graph-Constrained House Generation
We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations in an end-to-end fashion for the challenging graph-constrained house generation task. The proposed graph…
Generative Adversarial NetworkHouse GenerationNode ClassificationMulti-level Graph Matching Networks for Deep and Robust Graph Similarity Learning
While the celebrated graph neural networks yield effective representations for individual nodes of a graph, there has been relatively less success in extending to graph similarity learning. Recent works have considered e…
Graph ClassificationGraph MatchingGraph Neural NetworkGraph SimilarityGraph Transformer GANs with Graph Masked Modeling for Architectural Layout Generation
We present a novel graph Transformer generative adversarial network (GTGAN) to learn effective graph node relations in an end-to-end fashion for challenging graph-constrained architectural layout generation tasks. The pr…
Generative Adversarial NetworkGraph Representation LearningLayout GenerationNode Classification+1Multilevel Graph Matching Networks for Deep Graph Similarity Learning
While the celebrated graph neural networks yield effective representations for individual nodes of a graph, there has been relatively less success in extending to the task of graph similarity learning. Recent work on gra…
Graph ClassificationGraph MatchingGraph Neural NetworkGraph Regression+2Hierarchical Graph Matching Networks for Deep Graph Similarity Learning
While the celebrated graph neural networks yields effective representations for individual nodes of a graph, there has been relatively less success in extending to deep graph similarity learning. Recent work has conside…
Graph MatchingGraph Neural NetworkGraph Similarity