IDEAS home Printed from https://ideas.repec.org/a/cwi/itadva/v2y2024i1p14-26.html

GCN-MF: A graph convolutional network based on matrix factorization for recommendation

Author

Listed:
  • Junxi Yang

    (School of Computing, Beijing Information Science and Technology University, Beijing 100096, China)

  • Zongshui Wang

    (School of Economics and Management, Beijing Information Science and Technology University, Beijing 100096, China)

  • Chong Chen

    (School of Computing, Beijing Information Science and Technology University, Beijing 100096, China)

Abstract

With the increasing development of information technology and the rise of big data, the Internet has entered the era of information overload. While users enjoy the convenience brought by big data to their daily lives, they also face more and more information filtering and selection problems. In this context, recommendation systems have emerged, and existing recommendation systems cannot effectively deal with the problem of data sparsity. Therefore, this paper proposes a graph convolutional network based on matrix factorization for recommendation. The embedding layer uses matrix factorization instead of neighborhood aggregation, and the interaction layer uses multi-layer neural networks instead of simple inner products. Finally, on the Movielens-1M, Yelp and Gowalla public data set, NDCG and Recall are better than the existing baseline model, which effectively alleviates the data sparsity problem.

Suggested Citation

  • Junxi Yang & Zongshui Wang & Chong Chen, 2024. "GCN-MF: A graph convolutional network based on matrix factorization for recommendation," Innovation & Technology Advances, Berger Science Press, vol. 2(1), pages 14-26, April.
    • Handle: RePEc:cwi:itadva:v:2:y:2024:i:1:p:14-26
    DOI: 10.61187/ita.v2i1.30
    as

    Download full text from publisher

    File URL: https://bergersci.com/index.php/jta/article/view/30/37
    Download Restriction: no
    File URL: https://bergersci.com/index.php/jta/article/view/30
    Download Restriction: no
    File URL: https://libkey.io/10.61187/ita.v2i1.30?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cwi:itadva:v:2:y:2024:i:1:p:14-26. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Berger Science Press (email available below). General contact details of provider: https://www.bergersci.com/index.php/jta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.