Open Access iconOpen Access

ARTICLE

DMGNN: A Dual Multi-Relational GNN Model for Enhanced Recommendation

Siyue Li1,#,*, Tian Jin2,#, Erfan Wang3, Ranting Tao4, Jiaxin Lu5, Kai Xi6

1 Department of Computer Science, Northeastern University, Santa Clara, CA 95050, USA
2 School of Computational Science and Engineering, Georgia Institute of Technology, Atlanta, GA 30301, USA
3 Department of Computer Science, Rice University, Dallas, TX 75201, USA
4 Department of Statistics, The George Washington University, Rockville, MD 20847, USA
5 Information Studies, Trine University, Phoenix, AZ 85001, USA
6 Khoury College of Computer Sciences, Northeastern University, Seattle, WA 98101, USA

* Corresponding Author: Siyue Li. Email: email
# These authors contributed equally to this work

Computers, Materials & Continua 2025, 84(2), 2331-2353. https://doi.org/10.32604/cmc.2025.066382

Abstract

In the era of exponential growth of digital information, recommender algorithms are vital for helping users navigate vast data to find relevant items. Traditional approaches such as collaborative filtering and content-based methods have limitations in capturing complex, multi-faceted relationships in large-scale, sparse datasets. Recent advances in Graph Neural Networks (GNNs) have significantly improved recommendation performance by modeling high-order connection patterns within user-item interaction networks. However, existing GNN-based models like LightGCN and NGCF focus primarily on single-type interactions and often overlook diverse semantic relationships, leading to reduced recommendation diversity and limited generalization. To address these challenges, this paper proposes a dual multi-relational graph neural network recommendation algorithm based on relational interactions. Our approach constructs two complementary graph structures: a User-Item Interaction Graph (UIIG), which explicitly models direct user behaviors such as clicks and purchases, and a Relational Association Graph (RAG), which uncovers latent associations based on user similarities and item attributes. The proposed Dual Multi-relational Graph Neural Network (DMGNN) features two parallel branches that perform multi-layer graph convolutional operations, followed by an adaptive fusion mechanism to effectively integrate information from both graphs. This design enhances the model’s capacity to capture diverse relationship types and complex relational patterns. Extensive experiments conducted on benchmark datasets—including MovieLens-1M, Amazon-Electronics, and Yelp—demonstrate that DMGNN outperforms state-of-the-art baselines, achieving improvements of up to 12.3% in Precision, 9.7% in Recall, and 11.5% in F1 score. Moreover, DMGNN significantly boosts recommendation diversity by 15.2%, balancing accuracy with exploration. These results highlight the effectiveness of leveraging hierarchical multi-relational information, offering a promising solution to the challenges of data sparsity and relation heterogeneity in recommendation systems. Our work advances the theoretical understanding of multi-relational graph modeling and presents practical insights for developing more personalized, diverse, and robust recommender systems.

Keywords

Recommendation algorithm; graph neural network; multi-relational graph; relational interaction

Cite This Article

APA Style
Li, S., Jin, T., Wang, E., Tao, R., Lu, J. et al. (2025). DMGNN: A Dual Multi-Relational GNN Model for Enhanced Recommendation. Computers, Materials & Continua, 84(2), 2331–2353. https://doi.org/10.32604/cmc.2025.066382
Vancouver Style
Li S, Jin T, Wang E, Tao R, Lu J, Xi K. DMGNN: A Dual Multi-Relational GNN Model for Enhanced Recommendation. Comput Mater Contin. 2025;84(2):2331–2353. https://doi.org/10.32604/cmc.2025.066382
IEEE Style
S. Li, T. Jin, E. Wang, R. Tao, J. Lu, and K. Xi, “DMGNN: A Dual Multi-Relational GNN Model for Enhanced Recommendation,” Comput. Mater. Contin., vol. 84, no. 2, pp. 2331–2353, 2025. https://doi.org/10.32604/cmc.2025.066382



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 393

    View

  • 114

    Download

  • 0

    Like

Share Link