Confidence-Based Feature Imputation for Graphs with Partially Known
Features
- URL: http://arxiv.org/abs/2305.16618v2
- Date: Mon, 29 May 2023 02:58:13 GMT
- Title: Confidence-Based Feature Imputation for Graphs with Partially Known
Features
- Authors: Daeho Um, Jiwoong Park, Seulki Park, Jin Young Choi
- Abstract summary: We introduce a novel concept of channel-wise confidence in a node feature, which is assigned to each imputed channel feature of a node.
We then design pseudo-confidence using the channel-wise shortest path distance between a missing-feature node and its nearest known-feature node.
Based on the pseudo-confidence, we propose a novel feature imputation scheme that performs channel-wise inter-node diffusion and node-wise inter-channel propagation.
- Score: 11.96118246448543
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: This paper investigates a missing feature imputation problem for graph
learning tasks. Several methods have previously addressed learning tasks on
graphs with missing features. However, in cases of high rates of missing
features, they were unable to avoid significant performance degradation. To
overcome this limitation, we introduce a novel concept of channel-wise
confidence in a node feature, which is assigned to each imputed channel feature
of a node for reflecting certainty of the imputation. We then design
pseudo-confidence using the channel-wise shortest path distance between a
missing-feature node and its nearest known-feature node to replace unavailable
true confidence in an actual learning process. Based on the pseudo-confidence,
we propose a novel feature imputation scheme that performs channel-wise
inter-node diffusion and node-wise inter-channel propagation. The scheme can
endure even at an exceedingly high missing rate (e.g., 99.5\%) and it achieves
state-of-the-art accuracy for both semi-supervised node classification and link
prediction on various datasets containing a high rate of missing features.
Codes are available at https://github.com/daehoum1/pcfi.
Related papers
- Multitask Active Learning for Graph Anomaly Detection [48.690169078479116]
We propose a novel MultItask acTIve Graph Anomaly deTEction framework, namely MITIGATE.
By coupling node classification tasks, MITIGATE obtains the capability to detect out-of-distribution nodes without known anomalies.
Empirical studies on four datasets demonstrate that MITIGATE significantly outperforms the state-of-the-art methods for anomaly detection.
arXiv Detail & Related papers (2024-01-24T03:43:45Z) - Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data.
The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
arXiv Detail & Related papers (2024-01-12T17:57:07Z) - NodeFormer: A Scalable Graph Structure Learning Transformer for Node
Classification [70.51126383984555]
We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes.
The efficient computation is enabled by a kernerlized Gumbel-Softmax operator.
Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
arXiv Detail & Related papers (2023-06-14T09:21:15Z) - Is Rewiring Actually Helpful in Graph Neural Networks? [11.52174067809364]
We propose an evaluation setting based on message-passing models that do not require training to compute node and graph representations.
We perform a systematic experimental comparison on real-world node and graph classification tasks, showing that rewiring the underlying graph rarely does confer a practical benefit for message-passing.
arXiv Detail & Related papers (2023-05-31T10:12:23Z) - Self-supervised Guided Hypergraph Feature Propagation for
Semi-supervised Classification with Missing Node Features [9.684903457117917]
We propose a self-supervised guided hypergraph feature propagation (SGHFP)
Specifically, the feature hypergraph is first generated according to the node features with missing information.
Then, the reconstructed node features are fed to a two-layer GNNs to construct a pseudo-label hypergraph.
Extensive experiments demonstrate that the proposed SGHFP outperforms the existing semi-supervised classification with missing node feature methods.
arXiv Detail & Related papers (2023-02-16T12:13:46Z) - On the Unreasonable Effectiveness of Feature propagation in Learning on
Graphs with Missing Node Features [7.421573539569853]
We present a general approach for handling missing features in graph machine learning applications.
We experimentally show that the proposed approach outperforms previous methods on seven common node-classification benchmarks.
It takes only 10 seconds to run on a graph with $sim$2.5M nodes and $sim$123M edges on a single GPU.
arXiv Detail & Related papers (2021-11-23T19:50:46Z) - Very Deep Graph Neural Networks Via Noise Regularisation [57.450532911995516]
Graph Neural Networks (GNNs) perform learned message passing over an input graph.
We train a deep GNN with up to 100 message passing steps and achieve several state-of-the-art results.
arXiv Detail & Related papers (2021-06-15T08:50:10Z) - Unveiling Anomalous Edges and Nominal Connectivity of Attributed
Networks [53.56901624204265]
The present work deals with uncovering anomalous edges in attributed graphs using two distinct formulations with complementary strengths.
The first relies on decomposing the graph data matrix into low rank plus sparse components to improve markedly performance.
The second broadens the scope of the first by performing robust recovery of the unperturbed graph, which enhances the anomaly identification performance.
arXiv Detail & Related papers (2021-04-17T20:00:40Z) - Node2Seq: Towards Trainable Convolutions in Graph Neural Networks [59.378148590027735]
We propose a graph network layer, known as Node2Seq, to learn node embeddings with explicitly trainable weights for different neighboring nodes.
For a target node, our method sorts its neighboring nodes via attention mechanism and then employs 1D convolutional neural networks (CNNs) to enable explicit weights for information aggregation.
In addition, we propose to incorporate non-local information for feature learning in an adaptive manner based on the attention scores.
arXiv Detail & Related papers (2021-01-06T03:05:37Z) - Graph Convolutional Networks for Graphs Containing Missing Features [5.426650977249329]
We propose an approach that adapts Graph Convolutional Network (GCN) to graphs containing missing features.
In contrast to traditional strategy, our approach integrates the processing of missing features and graph learning within the same neural network architecture.
We demonstrate through extensive experiments that our approach significantly outperforms the imputation-based methods in node classification and link prediction tasks.
arXiv Detail & Related papers (2020-07-09T06:47:21Z)
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.