Evidence map›Paper›PMID 39619331›Full record

ArticleProceedings of the ... ACM International Conference on Information & Knowledge Management. ACM International Conference on Information and Knowledge Management2024

Federated Node Classification over Distributed Ego-Networks with Secure Contrastive Embedding Sharing.

Han Xie, Li Xiong, Carl Yang

Abstract read
In one paragraph

Article in Proceedings of the ... ACM International Conference on Information & Knowledge Management. ACM International Conference on Information and Knowledge Management, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Han XieEmory University, Atlanta, GA, United States.
Li XiongEmory University, Atlanta, GA, United States.
Carl YangEmory University, Atlanta, GA, United States.

Funding

Decentralized differentially-private methods for dynamic data release and analysisR01LM013712 · NLM · YALE UNIVERSITY · PI JIANG, XIAOQIAN, OHNO-MACHADO, LUCILA · 2022 to 2025
$2.5M
Sensor Hardware and Intelligent Tools for Assessing the Health Effects of Heat ExposureR01ES033241 · NIEHS · EMORY UNIVERSITY · PI HERTZBERG, VICKI STOVER, XIONG, LI · 2022 to 2025
$2.5M
Understanding Diabetes Heterogeneity via Mining Multimodality Interconnected DataK25DK135913 · NIDDK · EMORY UNIVERSITY · PI Ji Carl Yang · 2023 to 2026
$687k
NIDDK NIH HHS K25 DK135913NIEHS NIH HHS R01 ES033241NLM NIH HHS R01 LM013712
6 · The paper itself

Abstract

Federated learning on graphs (a.k.a., federated graph learning- FGL) has recently received increasing attention due to its capacity to enable collaborative learning over distributed graph datasets without compromising local clients' data privacy. In previous works, clients of FGL typically represent institutes or organizations that possess sets of entire graphs (e.g., molecule graphs in biochemical research) or parts of a larger graph (e.g., sub-user networks of e-commerce platforms). However, another natural paradigm exists where clients act as remote devices retaining the graph structures of local neighborhoods centered around the device owners (i.e., ego-networks), which can be modeled for specific graph applications such as user profiling on social ego-networks and infection prediction on contact ego-networks. FGL in such novel yet realistic ego-network settings faces the unique challenge of incomplete neighborhood information for non-ego local nodes since they likely appear and have different sets of neighbors in multiple ego-networks. To address this challenge, we propose an FGL method for distributed ego-networks in which clients obtain complete neighborhood information of local nodes through sharing node embeddings with other clients. A contrastive learning mechanism is proposed to bridge the gap between local and global node embeddings and stabilize the local training of graph neural network models, while a secure embedding sharing protocol is employed to protect individual node identity and embedding privacy against the server and other clients. Comprehensive experiments on various distributed ego-network datasets successfully demonstrate the effectiveness of our proposed embedding sharing method on top of different federated model sharing frameworks, and we also provide discussions on the potential efficiency and privacy drawbacks of the method as well as their future mitigation.

Indexed as

Contrastive LearningEfficiencyEgo-NetworksFederated LearningGraph Neural NetworksPrivacySecure Sharing

Identifiers

PMID39619331
PMCPMC11606401

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.