Pith. sign in

REVIEW 2 cited by

Incomplete Graph Representation and Learning via Partial Graph Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.10130 v2 pith:C6QCM3HU submitted 2020-03-23 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords graphgnnsincompletelearningpartialaggregationdatanetworks
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph Neural Networks (GNNs) are gaining increasing attention on graph data learning tasks in recent years. However, in many applications, graph may be coming in an incomplete form where attributes of graph nodes are partially unknown/missing. Existing GNNs are generally designed on complete graphs which can not deal with attribute-incomplete graph data directly. To address this problem, we develop a novel partial aggregation based GNNs, named Partial Graph Neural Networks (PaGNNs), for attribute-incomplete graph representation and learning. Our work is motivated by the observation that the neighborhood aggregation function in standard GNNs can be equivalently viewed as the neighborhood reconstruction formulation. Based on it, we define two novel partial aggregation (reconstruction) functions on incomplete graph and derive PaGNNs for incomplete graph data learning. Extensive experiments on several datasets demonstrate the effectiveness and efficiency of the proposed PaGNNs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Divide-Then-Rule: A Cluster-Driven Hierarchical Interpolator for Attribute-Missing Graphs

    cs.LG 2025-07 conditional novelty 6.0 of 10

    A hierarchical, cluster-aware imputation method (DTRGC) that reweights feature propagation by cluster membership and imputes missing node attributes in stages improves deep graph clustering on attribute-missing graphs.

  2. Scalable Attribute-Missing Graph Clustering via Neighborhood Differentiation

    cs.SI 2025-07 conditional novelty 5.0 of 10

    CMV-ND builds one feature view per exact hop distance and then runs existing clustering methods on those views, improving attribute-missing large-scale graph clustering in experiments.

Pith tools