Self-supervised category-enhanced graph neural networks for recommendation.

Saved in:
Bibliographic Details
Title: Self-supervised category-enhanced graph neural networks for recommendation.
Authors: Yang, Funing1 (AUTHOR) yfn@jlu.edu.cn, Du, Haihui1 (AUTHOR) duhh22@mails.jlu.edu.cn, Zhang, Xingliang2 (AUTHOR) zhangxingliang@jl.chinamobile.com, Yang, Yongjian1 (AUTHOR) yyj@jlu.edu.cn, Wang, Ying1 (AUTHOR) wangying2010@jlu.edu.cn
Source: Knowledge-Based Systems. Feb2025, Vol. 311, pN.PAG-N.PAG. 1p.
Subjects: Graph neural networks, Recommender systems, Knowledge graphs
Abstract: The emergence of Graph Neural Networks (GNNs) has substantially advanced recommendation systems based on collaborative filtering. Despite their effectiveness, these networks are often susceptible to noise and sparsity problems from datasets. Thus, contrastive learning and knowledge graphs have been introduced as solutions to recommendation systems. However, both of these techniques have been incorporated into recommendation models as auxiliary tasks, neglecting the enhancement of node representations for the overall task. Therefore, we propose a novel contrastive learning method called C ategory- E nriched C ontrastive L earning (CECL) to obtain high-quality user–item interactions. Unlike previous studies, CECL does not introduce categories into the recommendation system as auxiliary supervised signals but uses them as direct supervised signals during model training. This directly supervised signal can enable the model to learn and emphasise category-specific patterns and relationships more efficiently, resulting in more accurate and stable user and item embeddings. By showing optimised category alignment, CECL improves representation quality. Specifically, we first construct initial embeddings for users and items based on the categories of user interactions and those to which items belong. Then, these embeddings are input into the recommendation model. The primary recommendation task is conducted in the supervised model. In the self-supervised model, contrastive pairs are constructed using edge dropout, and the consistency between different views of the same node is maximised to explore stable category preferences. Finally, multi-task training is applied to jointly optimise the recommendation and contrastive learning tasks. Comprehensive experiments conducted on eight real-world datasets validate the effectiveness of the proposed CECL. Compared with existing graph-enhanced methods, CECL achieves an average improvement of 15.17% in Recall@20 and 9.64% in NDCG@20 metrics. Our implementations are available at https://github.com/shark-art/Code. [ABSTRACT FROM AUTHOR]
Copyright of Knowledge-Based Systems is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 183277773
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Self-supervised category-enhanced graph neural networks for recommendation.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Yang%2C+Funing%22">Yang, Funing</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> yfn@jlu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Du%2C+Haihui%22">Du, Haihui</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> duhh22@mails.jlu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Zhang%2C+Xingliang%22">Zhang, Xingliang</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> zhangxingliang@jl.chinamobile.com</i><br /><searchLink fieldCode="AR" term="%22Yang%2C+Yongjian%22">Yang, Yongjian</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> yyj@jlu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Ying%22">Wang, Ying</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> wangying2010@jlu.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Knowledge-Based+Systems%22">Knowledge-Based Systems</searchLink>. Feb2025, Vol. 311, pN.PAG-N.PAG. 1p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Graph+neural+networks%22">Graph neural networks</searchLink><br /><searchLink fieldCode="DE" term="%22Recommender+systems%22">Recommender systems</searchLink><br /><searchLink fieldCode="DE" term="%22Knowledge+graphs%22">Knowledge graphs</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The emergence of Graph Neural Networks (GNNs) has substantially advanced recommendation systems based on collaborative filtering. Despite their effectiveness, these networks are often susceptible to noise and sparsity problems from datasets. Thus, contrastive learning and knowledge graphs have been introduced as solutions to recommendation systems. However, both of these techniques have been incorporated into recommendation models as auxiliary tasks, neglecting the enhancement of node representations for the overall task. Therefore, we propose a novel contrastive learning method called C ategory- E nriched C ontrastive L earning (CECL) to obtain high-quality user–item interactions. Unlike previous studies, CECL does not introduce categories into the recommendation system as auxiliary supervised signals but uses them as direct supervised signals during model training. This directly supervised signal can enable the model to learn and emphasise category-specific patterns and relationships more efficiently, resulting in more accurate and stable user and item embeddings. By showing optimised category alignment, CECL improves representation quality. Specifically, we first construct initial embeddings for users and items based on the categories of user interactions and those to which items belong. Then, these embeddings are input into the recommendation model. The primary recommendation task is conducted in the supervised model. In the self-supervised model, contrastive pairs are constructed using edge dropout, and the consistency between different views of the same node is maximised to explore stable category preferences. Finally, multi-task training is applied to jointly optimise the recommendation and contrastive learning tasks. Comprehensive experiments conducted on eight real-world datasets validate the effectiveness of the proposed CECL. Compared with existing graph-enhanced methods, CECL achieves an average improvement of 15.17% in Recall@20 and 9.64% in NDCG@20 metrics. Our implementations are available at https://github.com/shark-art/Code. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Knowledge-Based Systems is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=183277773
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.knosys.2025.113109
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 1
        StartPage: N.PAG
    Subjects:
      – SubjectFull: Graph neural networks
        Type: general
      – SubjectFull: Recommender systems
        Type: general
      – SubjectFull: Knowledge graphs
        Type: general
    Titles:
      – TitleFull: Self-supervised category-enhanced graph neural networks for recommendation.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Yang, Funing
      – PersonEntity:
          Name:
            NameFull: Du, Haihui
      – PersonEntity:
          Name:
            NameFull: Zhang, Xingliang
      – PersonEntity:
          Name:
            NameFull: Yang, Yongjian
      – PersonEntity:
          Name:
            NameFull: Wang, Ying
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 28
              M: 02
              Text: Feb2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09507051
          Numbering:
            – Type: volume
              Value: 311
          Titles:
            – TitleFull: Knowledge-Based Systems
              Type: main
ResultId 1