On the Inference of Original Graph Information from Graph Embeddings

Author:

Li Yantao1ORCID,Li Xinyang2ORCID,Lei Xinyu3ORCID,Qin Huafeng4ORCID,Hu Yiwen5ORCID,Zhou Gang6ORCID

Affiliation:

1. College of Computer Science, Chongqing University, Chongqing, China

2. College of Computer Science, Chongqing University, Chongqing China

3. Department of Computer Science, Michigan Technological University, Houghton, United States

4. School of Computer Science and Information Engineering, Chongqing Technology and Business University, Chongqing China

5. Department of Computer Science and Engineering, Michigan State University, East Lansing, United States

6. Computer Science Department, William & Mary, Williamsburg, United States

Abstract

Graph embedding converts a graph data into a low dimensional space to preserve the original graph information. However, graph data can be reconstructed by malicious adversaries to train machine learning models from graph embeddings. This paper studies to what extent an adversary (without the original graph data) can recover the original graph data from graph embeddings. To quantify the original graph information leakage from graph embeddings, we develop a deep neural network model InferNet that can be used by adversaries to infer the original graph information from an adversary-accessible graph embedding database. More specifically, we propose the data-free reversed knowledge distillation technique to support the InferNet training even if the original graph dataset is absent. To ensure the performance of InferNet, we design two cycle-consistency loss functions to have an interactive training of InferNet over three series of datasets. To further enhance the performance of InferNet, we provide a joint training algorithm that simultaneously trains the pseudo-sample generator and InferNet, which significantly reduces the storage space. We evaluate the performance of InferNet on three datasets, and the intensive experiments demonstrate that InferNet can infer the original graph information from the graph embedding dataset with high accuracy.

Publisher

Association for Computing Machinery (ACM)

Reference56 articles.

1. Adam Goodge, Bryan Hooi, See-Kiong Ng, and Wee Siong Ng. 2022. Lunar: Unifying local outlier detection methods via graph neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol.  36. 6737–6745.

2. Qingdong He, Zhengning Wang, Hao Zeng, Yi Zeng, and Yijun Liu. 2022. Svga-net: Sparse voxel-graph attention network for 3d object detection from point clouds. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol.  36. 870–878.

3. Zaixi Zhang, Qi Liu, Hao Wang, Chengqiang Lu, and Cheekong Lee. 2022. Protgnn: Towards self-explaining graph neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol.  36. 9127–9135.

4. Tao Wang, Di Jin, Rui Wang, Dongxiao He, and Yuxiao Huang. 2022. Powerful graph convolutional networks with adaptive propagation mechanism for homophily and heterophily. In Proceedings of the AAAI conference on artificial intelligence, Vol.  36. 4210–4218.

5. Transformer based defense gan against palm-vein adversarial attacks;Li Yantao;IEEE Transactions on Information Forensics and Security,2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3