Graph Convolutional Extreme Learning Machine Autoencoder for Graph Embedding

Xinyi Lin, Xiaoyun Chen, Yanming Lin
{"title":"Graph Convolutional Extreme Learning Machine Autoencoder for Graph Embedding","authors":"Xinyi Lin, Xiaoyun Chen, Yanming Lin","doi":"10.1109/ICCECE58074.2023.10135334","DOIUrl":null,"url":null,"abstract":"The purpose of graph embedding is to encode the known node features and topological information of graph into low-dimensional embeddings for further downstream learning tasks. Graph autoencoders can aggregate graph topology and node features, but it is highly dependent on the gradient descent optimizer with a large iterative learning time, and susceptible to local optimal solutions. Thus, we propose Graph Convolutional Extreme Learning Machine Autoencoder. To address the limitation that the extreme learning machine autoencoder cannot use topological information, the graph convolution operation is introduced between the input layer and the hidden layer to improve the representation ability of the graph embedding obtained. Experiments of link prediction and node classification on 5 real datasets show that our method is effective.","PeriodicalId":120030,"journal":{"name":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE58074.2023.10135334","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The purpose of graph embedding is to encode the known node features and topological information of graph into low-dimensional embeddings for further downstream learning tasks. Graph autoencoders can aggregate graph topology and node features, but it is highly dependent on the gradient descent optimizer with a large iterative learning time, and susceptible to local optimal solutions. Thus, we propose Graph Convolutional Extreme Learning Machine Autoencoder. To address the limitation that the extreme learning machine autoencoder cannot use topological information, the graph convolution operation is introduced between the input layer and the hidden layer to improve the representation ability of the graph embedding obtained. Experiments of link prediction and node classification on 5 real datasets show that our method is effective.
图卷积极限学习机自编码器图嵌入
图嵌入的目的是将已知的图节点特征和拓扑信息编码成低维嵌入,用于进一步的下游学习任务。图自编码器可以聚合图拓扑和节点特征,但高度依赖梯度下降优化器,迭代学习时间长,易受局部最优解的影响。因此,我们提出了图卷积极限学习机自编码器。为了解决极限学习机自编码器不能利用拓扑信息的限制,在输入层和隐藏层之间引入图卷积运算,提高了得到的图嵌入的表示能力。在5个真实数据集上进行的链路预测和节点分类实验表明,该方法是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信