Neighbor Enhanced Graph Convolutional Networks for Node Classification and Recommendation

• URL: http://arxiv.org/abs/2203.16097v1
• Date: Wed, 30 Mar 2022 06:54:28 GMT
• Title: Neighbor Enhanced Graph Convolutional Networks for Node Classification and Recommendation
• Authors: Hao Chen, Zhong Huang, Yue Xu, Zengde Deng, Feiran Huang, Peng He, Zhoujun Li
• Abstract summary: We theoretically analyze the affection of the neighbor quality over GCN models' performance. We propose the Neighbor Enhanced Graph Convolutional Network (NEGCN) framework to boost the performance of existing GCN models.
• Score: 30.179717374489414
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The recently proposed Graph Convolutional Networks (GCNs) have achieved significantly superior performance on various graph-related tasks, such as node classification and recommendation. However, currently researches on GCN models usually recursively aggregate the information from all the neighbors or randomly sampled neighbor subsets, without explicitly identifying whether the aggregated neighbors provide useful information during the graph convolution. In this paper, we theoretically analyze the affection of the neighbor quality over GCN models' performance and propose the Neighbor Enhanced Graph Convolutional Network (NEGCN) framework to boost the performance of existing GCN models. Our contribution is three-fold. First, we at the first time propose the concept of neighbor quality for both node classification and recommendation tasks in a general theoretical framework. Specifically, for node classification, we propose three propositions to theoretically analyze how the neighbor quality affects the node classification performance of GCN models. Second, based on the three proposed propositions, we introduce the graph refinement process including specially designed neighbor evaluation methods to increase the neighbor quality so as to boost both the node classification and recommendation tasks. Third, we conduct extensive node classification and recommendation experiments on several benchmark datasets. The experimental results verify that our proposed NEGCN framework can significantly enhance the performance for various typical GCN models on both node classification and recommendation tasks.

Related papers

• A Novel Evaluation Perspective on GNNs-based Recommender Systems through the Topology of the User-Item Graph [14.12873271435375]
  Graph neural networks (GNNs)-based recommender systems have encountered great success in recommendation. We provide a novel evaluation perspective on GNNs-based recommendation, which investigates the impact of the graph topology on the recommendation performance.
  arXiv  Detail & Related papers  (2024-08-21T16:34:53Z)
• Cluster-based Graph Collaborative Filtering [55.929052969825825]
  Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems. Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
  arXiv  Detail & Related papers  (2024-04-16T07:05:16Z)
• How Expressive are Graph Neural Networks in Recommendation? [17.31401354442106]
  Graph Neural Networks (GNNs) have demonstrated superior performance on various graph learning tasks, including recommendation. Recent research has explored the expressiveness of GNNs in general, demonstrating that message passing GNNs are at most as powerful as the Weisfeiler-Lehman test. We propose the topological closeness metric to evaluate GNNs' ability to capture the structural distance between nodes.
  arXiv  Detail & Related papers  (2023-08-22T02:17:34Z)
• Flattened Graph Convolutional Networks For Recommendation [18.198536511983452]
  This paper proposes the flattened GCN(FlatGCN) model, which is able to achieve superior performance with remarkably less complexity compared with existing models. First, we propose a simplified but powerful GCN architecture which aggregates the neighborhood information using one flattened GCN layer. Second, we propose an informative neighbor-infomax sampling method to select the most valuable neighbors by measuring the correlation among neighboring nodes. Third, we propose a layer ensemble technique which improves the expressiveness of the learned representations by assembling the layer-wise neighborhood representations at the final layer.
  arXiv  Detail & Related papers  (2022-09-25T12:53:50Z)
• A Variational Edge Partition Model for Supervised Graph Representation Learning [51.30365677476971]
  This paper introduces a graph generative process to model how the observed edges are generated by aggregating the node interactions over a set of overlapping node communities. We partition each edge into the summation of multiple community-specific weighted edges and use them to define community-specific GNNs. A variational inference framework is proposed to jointly learn a GNN based inference network that partitions the edges into different communities, these community-specific GNNs, and a GNN based predictor that combines community-specific GNNs for the end classification task.
  arXiv  Detail & Related papers  (2022-02-07T14:37:50Z)
• Node Similarity Preserving Graph Convolutional Networks [51.520749924844054]
  Graph Neural Networks (GNNs) explore the graph structure and node features by aggregating and transforming information within node neighborhoods. We propose SimP-GCN that can effectively and efficiently preserve node similarity while exploiting graph structure. We validate the effectiveness of SimP-GCN on seven benchmark datasets including three assortative and four disassorative graphs.
  arXiv  Detail & Related papers  (2020-11-19T04:18:01Z)
• CatGCN: Graph Convolutional Networks with Categorical Node Features [99.555850712725]
  CatGCN is tailored for graph learning when the node features are categorical. We train CatGCN in an end-to-end fashion and demonstrate it on semi-supervised node classification.
  arXiv  Detail & Related papers  (2020-09-11T09:25:17Z)
• Single-Layer Graph Convolutional Networks For Recommendation [17.3621098912528]
  Graph Convolutional Networks (GCNs) have received significant attention and achieved start-of-the-art performances on recommendation tasks. Existing GCN models tend to perform recursion aggregations among all related nodes, which arises severe computational burden. We propose a single GCN layer to aggregate information from the neighbors filtered by DA similarity and then generates the node representations.
  arXiv  Detail & Related papers  (2020-06-07T14:38:47Z)
• A Collective Learning Framework to Boost GNN Expressiveness [25.394456460032625]
  We consider the task of inductive node classification using Graph Neural Networks (GNNs) in supervised and semi-supervised settings. We propose a general collective learning approach to increase the representation power of any existing GNN. We evaluate performance on five real-world network datasets and demonstrate consistent, significant improvement in node classification accuracy.
  arXiv  Detail & Related papers  (2020-03-26T22:07:28Z)
• Unifying Graph Convolutional Neural Networks and Label Propagation [73.82013612939507]
  We study the relationship between LPA and GCN in terms of two aspects: feature/label smoothing and feature/label influence. Based on our theoretical analysis, we propose an end-to-end model that unifies GCN and LPA for node classification. Our model can also be seen as learning attention weights based on node labels, which is more task-oriented than existing feature-based attention models.
  arXiv  Detail & Related papers  (2020-02-17T03:23:13Z)
• Bilinear Graph Neural Network with Neighbor Interactions [106.80781016591577]
  Graph Neural Network (GNN) is a powerful model to learn representations and make predictions on graph data. We propose a new graph convolution operator, which augments the weighted sum with pairwise interactions of the representations of neighbor nodes. We term this framework as Bilinear Graph Neural Network (BGNN), which improves GNN representation ability with bilinear interactions between neighbor nodes.
  arXiv  Detail & Related papers  (2020-02-10T06:43:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.