G-SPARC: SPectral ARchitectures tackling the Cold-start problem in Graph learning

• URL: http://arxiv.org/abs/2411.01532v1
• Date: Sun, 03 Nov 2024 11:39:09 GMT
• Title: G-SPARC: SPectral ARchitectures tackling the Cold-start problem in Graph learning
• Authors: Yahel Jacobs, Reut Dayan, Uri Shaham,
• Abstract summary: We propose G-SPARC, a novel framework addressing cold-start nodes. By utilizing a key idea of transitioning from graph representation to spectral representation, our approach is generalizable to cold-start nodes. Our method outperforms existing models on cold-start nodes across various tasks like node classification, node clustering, and link prediction.
• Score: 3.870455775654713
• License:
• Abstract: Graphs play a central role in modeling complex relationships across various domains. Most graph learning methods rely heavily on neighborhood information, raising the question of how to handle cold-start nodes - nodes with no known connections within the graph. These models often overlook the cold-start nodes, making them ineffective for real-world scenarios. To tackle this, we propose G-SPARC, a novel framework addressing cold-start nodes, that leverages generalizable spectral embedding. This framework enables extension to state-of-the-art methods making them suitable for practical applications. By utilizing a key idea of transitioning from graph representation to spectral representation, our approach is generalizable to cold-start nodes, capturing the global structure of the graph without relying on adjacency data. Experimental results demonstrate that our method outperforms existing models on cold-start nodes across various tasks like node classification, node clustering, and link prediction. G-SPARC provides a breakthrough built-in solution to the cold-start problem in graph learning. Our code will be publicly available upon acceptance.

Related papers

• Spectral Greedy Coresets for Graph Neural Networks [61.24300262316091]
  The ubiquity of large-scale graphs in node-classification tasks hinders the real-world applications of Graph Neural Networks (GNNs) This paper studies graph coresets for GNNs and avoids the interdependence issue by selecting ego-graphs based on their spectral embeddings. Our spectral greedy graph coreset (SGGC) scales to graphs with millions of nodes, obviates the need for model pre-training, and applies to low-homophily graphs.
  arXiv  Detail & Related papers  (2024-05-27T17:52:12Z)
• 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)
• OpenGraph: Towards Open Graph Foundation Models [20.401374302429627]
  Graph Neural Networks (GNNs) have emerged as promising techniques for encoding structural information. Key challenge remains: the difficulty of generalizing to unseen graph data with different properties. We propose a novel graph foundation model, called OpenGraph, to address this challenge.
  arXiv  Detail & Related papers  (2024-03-02T08:05:03Z)
• GraphEdit: Large Language Models for Graph Structure Learning [62.618818029177355]
  Graph Structure Learning (GSL) focuses on capturing intrinsic dependencies and interactions among nodes in graph-structured data. Existing GSL methods heavily depend on explicit graph structural information as supervision signals. We propose GraphEdit, an approach that leverages large language models (LLMs) to learn complex node relationships in graph-structured data.
  arXiv  Detail & Related papers  (2024-02-23T08:29:42Z)
• GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy [21.553180564868306]
  GraphRARE is a framework built upon node relative entropy and deep reinforcement learning. An innovative node relative entropy is used to measure mutual information between node pairs. A deep reinforcement learning-based algorithm is developed to optimize the graph topology.
  arXiv  Detail & Related papers  (2023-12-15T11:30:18Z)
• Deep Manifold Learning with Graph Mining [80.84145791017968]
  We propose a novel graph deep model with a non-gradient decision layer for graph mining. The proposed model has achieved state-of-the-art performance compared to the current models.
  arXiv  Detail & Related papers  (2022-07-18T04:34:08Z)
• Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods [69.13371028670153]
  We introduce feature-contribution ratio (FCR) to study the viability of using inductive GNNs to solve the Strict Cold Start (SCS) problem. We experimentally show FCR disentangles the contributions of various components of graph datasets and demonstrate the superior performance of Cold Brew.
  arXiv  Detail & Related papers  (2021-11-08T21:29:25Z)
• Inferential SIR-GN: Scalable Graph Representation Learning [0.4699313647907615]
  Graph representation learning methods generate numerical vector representations for the nodes in a network. In this work, we propose Inferential SIR-GN, a model which is pre-trained on random graphs, then computes node representations rapidly. We demonstrate that the model is able to capture node's structural role information, and show excellent performance at node and graph classification tasks, on unseen networks.
  arXiv  Detail & Related papers  (2021-11-08T20:56:37Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)
• Schema-Aware Deep Graph Convolutional Networks for Heterogeneous Graphs [10.526065883783899]
  Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. We propose our GCN framework 'Deep Heterogeneous Graph Convolutional Network (DHGCN)' It takes advantage of the schema of a heterogeneous graph and uses a hierarchical approach to effectively utilize information many hops away.
  arXiv  Detail & Related papers  (2021-05-03T06:24:27Z)

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.