A Novel Hypercomplex Graph Convolution Refining Mechanism

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jingchao Wang;Guoheng Huang;Guo Zhong;Xiaochen Yuan;Chi-Man Pun;Jinxun Wang;Jianqi Liu
{"title":"A Novel Hypercomplex Graph Convolution Refining Mechanism","authors":"Jingchao Wang;Guoheng Huang;Guo Zhong;Xiaochen Yuan;Chi-Man Pun;Jinxun Wang;Jianqi Liu","doi":"10.1109/TETCI.2024.3449877","DOIUrl":null,"url":null,"abstract":"Hypercomplex graph convolutions with higher hypercomplex dimensions can extract more complex features in graphs and features with varying levels of complexity are suited for different situation. However, existing hypercomplex graph neural networks have a constraint that they can only carry out hypercomplex graph convolutions in a predetermined and unchangeable dimension. To address this limitation, this paper presents a solution to overcome this limitation by introducing the FFT-based Adaptive Fourier hypercomplex graph convolution filtering mechanism (FAF mechanism), which can adaptively select hypercomplex graph convolutions with the most appropriate dimensions for different situations by projecting the outputs from all candidate hypercomplex graph convolutions to the frequency domain and selecting the one with the highest energy via the FFT-based Adaptive Fourier Decomposition. Meanwhile, we apply the FAF mechanism to our proposed hypercomplex high-order interaction graph neural network (HHG-Net), which performs high-order interaction and strengthens interaction features through quantum graph hierarchical attention module and feature interaction gated graph convolution. During convolution filtering, the FAF mechanism projects the outputs from different candidate hypercomplex graph convolutions to the frequency domain, extracts their energy, and selects the convolution that outputs the largest energy. After that, the model with selected hypercomplex graph convolutions is trained again. Our method outperforms many benchmarks, including the model with hypercomplex graph convolutions selected by DARTS, in node classification, graph classification, and text classification. This showcases the versatility of our approach, which can be effectively applied to both graph and text data.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"9 2","pages":"1673-1687"},"PeriodicalIF":5.3000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10666797/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Hypercomplex graph convolutions with higher hypercomplex dimensions can extract more complex features in graphs and features with varying levels of complexity are suited for different situation. However, existing hypercomplex graph neural networks have a constraint that they can only carry out hypercomplex graph convolutions in a predetermined and unchangeable dimension. To address this limitation, this paper presents a solution to overcome this limitation by introducing the FFT-based Adaptive Fourier hypercomplex graph convolution filtering mechanism (FAF mechanism), which can adaptively select hypercomplex graph convolutions with the most appropriate dimensions for different situations by projecting the outputs from all candidate hypercomplex graph convolutions to the frequency domain and selecting the one with the highest energy via the FFT-based Adaptive Fourier Decomposition. Meanwhile, we apply the FAF mechanism to our proposed hypercomplex high-order interaction graph neural network (HHG-Net), which performs high-order interaction and strengthens interaction features through quantum graph hierarchical attention module and feature interaction gated graph convolution. During convolution filtering, the FAF mechanism projects the outputs from different candidate hypercomplex graph convolutions to the frequency domain, extracts their energy, and selects the convolution that outputs the largest energy. After that, the model with selected hypercomplex graph convolutions is trained again. Our method outperforms many benchmarks, including the model with hypercomplex graph convolutions selected by DARTS, in node classification, graph classification, and text classification. This showcases the versatility of our approach, which can be effectively applied to both graph and text data.
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信