Scholarlink

In this chapter, we introduce the interest-aware message-passing graph convolutional network, which leverages high-order neighbors within the same subgraph. These user nodes exhibit more similar interests compared to those in other subgraphs, effectively mitigating the over-smoothing problem.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Interest-aware Message-Passing Graph Convolutional Network

  • 章节

  • 发表日期：

    2025年

查看全文
  • Fan Liu,
  • Liqiang Nie

摘要

In this chapter, we introduce the interest-aware message-passing graph convolutional network, which leverages high-order neighbors within the same subgraph. These user nodes exhibit more similar interests compared to those in other subgraphs, effectively mitigating the over-smoothing problem.