{"title":"迭代图网络","authors":"Wenchuan Zhang, Weihua Ou, Shili Niu, Ruxin Wang, Ziqi Zhu, Shen Ke","doi":"10.1109/ICCSS53909.2021.9721961","DOIUrl":null,"url":null,"abstract":"Graph neural networks are widespreadly used in the field of graph data analysis and processing. Recent methods either reduce the spatial receptive field for low algorithm complexity, or greatly lose efficiency in order to realize attention mechanism. To tackle this issue, we propose Iteration Graph Network (IGN), which uses an iterative inversion method to aggregate node feature and the k-localized neighbor information of nodes. In the graph-based semi-supervised node classification task, our method surpasses the state-of-the-art method in the benchmark datasets and experiment conclusion show that our model outperforms graph attention networks (GAT) and is more than 3 times faster than graph attention networks, consumes more than 6 times less memory than GAT. Our code will be make publicly available.","PeriodicalId":435816,"journal":{"name":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Iteration Graph Network\",\"authors\":\"Wenchuan Zhang, Weihua Ou, Shili Niu, Ruxin Wang, Ziqi Zhu, Shen Ke\",\"doi\":\"10.1109/ICCSS53909.2021.9721961\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph neural networks are widespreadly used in the field of graph data analysis and processing. Recent methods either reduce the spatial receptive field for low algorithm complexity, or greatly lose efficiency in order to realize attention mechanism. To tackle this issue, we propose Iteration Graph Network (IGN), which uses an iterative inversion method to aggregate node feature and the k-localized neighbor information of nodes. In the graph-based semi-supervised node classification task, our method surpasses the state-of-the-art method in the benchmark datasets and experiment conclusion show that our model outperforms graph attention networks (GAT) and is more than 3 times faster than graph attention networks, consumes more than 6 times less memory than GAT. Our code will be make publicly available.\",\"PeriodicalId\":435816,\"journal\":{\"name\":\"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSS53909.2021.9721961\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSS53909.2021.9721961","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Graph neural networks are widespreadly used in the field of graph data analysis and processing. Recent methods either reduce the spatial receptive field for low algorithm complexity, or greatly lose efficiency in order to realize attention mechanism. To tackle this issue, we propose Iteration Graph Network (IGN), which uses an iterative inversion method to aggregate node feature and the k-localized neighbor information of nodes. In the graph-based semi-supervised node classification task, our method surpasses the state-of-the-art method in the benchmark datasets and experiment conclusion show that our model outperforms graph attention networks (GAT) and is more than 3 times faster than graph attention networks, consumes more than 6 times less memory than GAT. Our code will be make publicly available.