Pith. sign in

REVIEW 1 cited by

A Vertical Federated Learning Framework for Graph Convolutional Network

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 2106.11593 v1 pith:FYASP6ZB submitted 2021-06-22 cs.LG cs.AI

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

Recently, Graph Neural Network (GNN) has achieved remarkable success in various real-world problems on graph data. However in most industries, data exists in the form of isolated islands and the data privacy and security is also an important issue. In this paper, we propose FedVGCN, a federated GCN learning paradigm for privacy-preserving node classification task under data vertically partitioned setting, which can be generalized to existing GCN models. Specifically, we split the computation graph data into two parts. For each iteration of the training process, the two parties transfer intermediate results to each other under homomorphic encryption. We conduct experiments on benchmark data and the results demonstrate the effectiveness of FedVGCN in the case of GraphSage.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Attributed Graph Clustering in Collaborative Settings

    cs.LG 2024-11 conditional novelty 5.0 of 10

    A collaborative method clusters attributed graphs under vertical data partitioning, using local k-means and secure aggregation to match centralized accuracy with lower communication cost.

Pith tools