LightCapsGNN: light capsule graph neural network for graph classification

IF 2.5 4区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge and Information Systems Pub Date : 2024-07-04 DOI:10.1007/s10115-024-02170-y
Yucheng Yan, Jin Li, Shuling Xu, Xinlong Chen, Genggeng Liu, Yang-Geng Fu
{"title":"LightCapsGNN: light capsule graph neural network for graph classification","authors":"Yucheng Yan, Jin Li, Shuling Xu, Xinlong Chen, Genggeng Liu, Yang-Geng Fu","doi":"10.1007/s10115-024-02170-y","DOIUrl":null,"url":null,"abstract":"<p>Graph neural networks (GNNs) have achieved excellent performances in many graph-related tasks. However, they need appropriate pooling operations to deal with the graph classification tasks, and thus, they may suffer from some limitations such as information loss and ignorance of the part-whole relationships. CapsGNN is proposed to solve the above-mentioned issues, but suffers from high time and space complexities leading to its poor scalability. In this paper, we propose a novel, effective and efficient graph capsule network called <i>LightCapsGNN</i>. First, we devise a fast voting mechanism (called <i>LightVoting</i>) implemented via linear combinations of <i>K</i> shared transformation matrices to reduce the number of trainable parameters in the voting procedure. Second, an improved reconstruction layer is proposed to encourage our model to capture more informative and essential knowledge of the input graph. Third, other improvements are combined to further accelerate our model, <i>e.g.</i>, matrix capsules and a trainable routing mechanism. Finally, extensive experiments are conducted on the popular real-world graph benchmarks in the graph classification tasks and the proposed model can achieve competitive or even better performance compared to ten baselines or state-of-the-art models. Furthermore, compared to other CapsGNNs, the proposed model reduce almost <span>\\(99\\%\\)</span> learnable parameters and <span>\\(31.1\\%\\)</span> running time.</p>","PeriodicalId":54749,"journal":{"name":"Knowledge and Information Systems","volume":"37 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge and Information Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10115-024-02170-y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Graph neural networks (GNNs) have achieved excellent performances in many graph-related tasks. However, they need appropriate pooling operations to deal with the graph classification tasks, and thus, they may suffer from some limitations such as information loss and ignorance of the part-whole relationships. CapsGNN is proposed to solve the above-mentioned issues, but suffers from high time and space complexities leading to its poor scalability. In this paper, we propose a novel, effective and efficient graph capsule network called LightCapsGNN. First, we devise a fast voting mechanism (called LightVoting) implemented via linear combinations of K shared transformation matrices to reduce the number of trainable parameters in the voting procedure. Second, an improved reconstruction layer is proposed to encourage our model to capture more informative and essential knowledge of the input graph. Third, other improvements are combined to further accelerate our model, e.g., matrix capsules and a trainable routing mechanism. Finally, extensive experiments are conducted on the popular real-world graph benchmarks in the graph classification tasks and the proposed model can achieve competitive or even better performance compared to ten baselines or state-of-the-art models. Furthermore, compared to other CapsGNNs, the proposed model reduce almost \(99\%\) learnable parameters and \(31.1\%\) running time.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
LightCapsGNN:用于图分类的光胶囊图神经网络
图神经网络(GNN)在许多与图相关的任务中都取得了出色的表现。然而,它们需要适当的池化操作来处理图分类任务,因此可能会受到一些限制,如信息丢失和忽略部分-整体关系。CapsGNN 就是为了解决上述问题而提出的,但它在时间和空间上的复杂性较高,导致其可扩展性较差。在本文中,我们提出了一种新颖、有效和高效的图胶囊网络--LightCapsGNN。首先,我们设计了一种通过 K 个共享变换矩阵的线性组合实现的快速投票机制(称为 LightVoting),以减少投票过程中可训练参数的数量。其次,我们提出了一个改进的重构层,以鼓励我们的模型捕捉输入图的更多信息和基本知识。第三,结合其他改进措施来进一步加速我们的模型,例如矩阵胶囊和可训练路由机制。最后,我们在图分类任务中对流行的真实图基准进行了广泛的实验,与十种基准或最先进的模型相比,所提出的模型可以获得具有竞争力甚至更好的性能。此外,与其他CapsGNNs相比,所提出的模型减少了近99%的可学习参数和31.1%的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Knowledge and Information Systems
Knowledge and Information Systems 工程技术-计算机:人工智能
CiteScore
5.70
自引率
7.40%
发文量
152
审稿时长
7.2 months
期刊介绍: Knowledge and Information Systems (KAIS) provides an international forum for researchers and professionals to share their knowledge and report new advances on all topics related to knowledge systems and advanced information systems. This monthly peer-reviewed archival journal publishes state-of-the-art research reports on emerging topics in KAIS, reviews of important techniques in related areas, and application papers of interest to a general readership.
期刊最新文献
Dynamic evolution of causal relationships among cryptocurrencies: an analysis via Bayesian networks Deep multi-semantic fuzzy K-means with adaptive weight adjustment Class incremental named entity recognition without forgetting Spectral clustering with scale fairness constraints Supervised kernel-based multi-modal Bhattacharya distance learning for imbalanced data classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1