A novel message passing neural network based on neighborhood expansion

Author:

Xue Yanfeng,Jin ZhenORCID,Apasiba Abeo Timothy

Abstract

AbstractMost message passing neural networks (MPNNs) are widely used for assortative network representation learning under the assumption of homophily between connected nodes. However, this fundamental assumption is inconsistent with the heterophily of disassortative networks (DNs) in many real-world applications. Therefore, we propose a novel MPNN called NEDA based on neighborhood expansion for disassortative network representation learning (DNRL). Specifically, our NEDA first performs neighborhood expansion to seek more informative nodes for aggregation and then performs data augmentation to speed up the optimization process of a set of parameter matrices at the maximum available training data with minimal computational cost. To evaluate the performance of NEDA comprehensively, we perform several experiments on benchmark disassortative network datasets with variable sizes, where the results demonstrate the effectiveness of our NEDA model. The code is publicly available at https://github.com/xueyanfeng/NEDA.

Funder

National Natural Science Foundation of China

Scientific and Technologial Innovation Programs of Higher Education Institutions in Shanxi

Key Projects of Health Commission in Shanxi

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Software

Reference52 articles.

1. Backstrom L, Boldi P, Rosa M, Ugander J, Vigna S (2012) Four degrees of separation. In: Proceedings of the 4th annual ACM web science conference, WebSci ’12. Association for Computing Machinery, New York, NY, USA, p 33-42. https://doi.org/10.1145/2380718.2380723

2. Bai WJ, Zhou T, Wang BH (2007) Immunization of susceptible-infected model on scale-free networks. Physica A 384(2):656–662

3. Barabasi AL (2016) Network science. Cambridge University Press, Cambridge

4. Bojchevski A, Günnemann S (2018) Deep gaussian embedding of graphs: unsupervised inductive learning via ranking. In: International conference on learning representations, p 1–13

5. Bojchevski A, Klicpera J, Perozzi B, Blais M, Kapoor A, Lukasik M, Günnemann S (2019) Is pagerank all you need for scalable graph neural networks? In: Proceedings of the 15th international workshop on mining and learning with graphs (MLG)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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