Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network

• URL: http://arxiv.org/abs/2302.00873v3
• Date: Sat, 8 Apr 2023 16:13:54 GMT
• Title: Predicting the Silent Majority on Graphs: Knowledge Transferable Graph Neural Network
• Authors: Wendong Bi, Bingbing Xu, Xiaoqian Sun, Li Xu, Huawei Shen, Xueqi Cheng
• Abstract summary: Graphs consisting of vocal nodes ("the vocal minority") and silent nodes ("the silent majority"), namely VS-Graph, are ubiquitous in the real world. We propose Knowledge Transferable Graph Neural Network (KT-GNN), which models distribution shifts during message passing and representation learning.
• Score: 45.790140824712616
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graphs consisting of vocal nodes ("the vocal minority") and silent nodes ("the silent majority"), namely VS-Graph, are ubiquitous in the real world. The vocal nodes tend to have abundant features and labels. In contrast, silent nodes only have incomplete features and rare labels, e.g., the description and political tendency of politicians (vocal) are abundant while not for ordinary people (silent) on the twitter's social network. Predicting the silent majority remains a crucial yet challenging problem. However, most existing message-passing based GNNs assume that all nodes belong to the same domain, without considering the missing features and distribution-shift between domains, leading to poor ability to deal with VS-Graph. To combat the above challenges, we propose Knowledge Transferable Graph Neural Network (KT-GNN), which models distribution shifts during message passing and representation learning by transferring knowledge from vocal nodes to silent nodes. Specifically, we design the domain-adapted "feature completion and message passing mechanism" for node representation learning while preserving domain difference. And a knowledge transferable classifier based on KL-divergence is followed. Comprehensive experiments on real-world scenarios (i.e., company financial risk assessment and political elections) demonstrate the superior performance of our method. Our source code has been open sourced.

Related papers

• SF-GNN: Self Filter for Message Lossless Propagation in Deep Graph Neural Network [38.669815079957566]
  Graph Neural Network (GNN) with the main idea of encoding graph structure information of graphs by propagation and aggregation has developed rapidly. It achieved excellent performance in representation learning of multiple types of graphs such as homogeneous graphs, heterogeneous graphs, and more complex graphs like knowledge graphs. For the phenomenon of performance degradation in deep GNNs, we propose a new perspective.
  arXiv  Detail & Related papers  (2024-07-03T02:40:39Z)
• EntailE: Introducing Textual Entailment in Commonsense Knowledge Graph Completion [54.12709176438264]
  Commonsense knowledge graphs (CSKGs) utilize free-form text to represent named entities, short phrases, and events as their nodes. Current methods leverage semantic similarities to increase the graph density, but the semantic plausibility of the nodes and their relations are under-explored. We propose to adopt textual entailment to find implicit entailment relations between CSKG nodes, to effectively densify the subgraph connecting nodes within the same conceptual class.
  arXiv  Detail & Related papers  (2024-02-15T02:27:23Z)
• Degree-based stratification of nodes in Graph Neural Networks [66.17149106033126]
  We modify the Graph Neural Network (GNN) architecture so that the weight matrices are learned, separately, for the nodes in each group. This simple-to-implement modification seems to improve performance across datasets and GNN methods.
  arXiv  Detail & Related papers  (2023-12-16T14:09:23Z)
• KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification [75.95647590619929]
  Zero-Shot Node Classification (ZNC) has been an emerging and crucial task in graph data analysis. We propose a Knowledge-Aware Multi-Faceted framework (KMF) that enhances the richness of label semantics. A novel geometric constraint is developed to alleviate the problem of prototype drift caused by node information aggregation.
  arXiv  Detail & Related papers  (2023-08-15T02:38:08Z)
• Evidential Temporal-aware Graph-based Social Event Detection via Dempster-Shafer Theory [76.4580340399321]
  We propose ETGNN, a novel Evidential Temporal-aware Graph Neural Network. We construct view-specific graphs whose nodes are the texts and edges are determined by several types of shared elements respectively. Considering the view-specific uncertainty, the representations of all views are converted into mass functions through evidential deep learning (EDL) neural networks.
  arXiv  Detail & Related papers  (2022-05-24T16:22:40Z)
• Natural Graph Networks [80.77570956520482]
  We show that the more general concept of naturality is sufficient for a graph network to be well-defined. We define global and local natural graph networks, the latter of which are as scalable as conventional message passing graph neural networks.
  arXiv  Detail & Related papers  (2020-07-16T14:19:06Z)
• Locally Private Graph Neural Networks [12.473486843211573]
  We study the problem of node data privacy, where graph nodes have potentially sensitive data that is kept private. We develop a privacy-preserving, architecture-agnostic GNN learning algorithm with formal privacy guarantees. Experiments conducted over real-world datasets demonstrate that our method can maintain a satisfying level of accuracy with low privacy loss.
  arXiv  Detail & Related papers  (2020-06-09T22:36:06Z)
• Improving Expressivity of Graph Neural Networks [0.0]
  We propose a Graph Neural Network with greater expressive power than commonly used GNNs. We use a graph attention network with expanding attention window that aggregates information from nodes exponentially far away.
  arXiv  Detail & Related papers  (2020-04-08T17:24:58Z)
• Feature-Attention Graph Convolutional Networks for Noise Resilient Learning [20.059242373860013]
  We propose FA-GCN, a feature-attention graph convolution learning framework, to handle networks with noisy and sparse node content. Experiments and validations, w.r.t. different noise levels, demonstrate that FA-GCN achieves better performance than state-of-the-art methods on both noise-free and noisy networks.
  arXiv  Detail & Related papers  (2019-12-26T02:51:55Z)

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.