S. Muppidi, Anupama Angadi, Satya Keerthi Gorripati
{"title":"Semi-Supervised Label Propagation Community Detection on Graphs with Graph Neural Network","authors":"S. Muppidi, Anupama Angadi, Satya Keerthi Gorripati","doi":"10.1109/ICAITPR51569.2022.9844211","DOIUrl":null,"url":null,"abstract":"The Graph Neural Network is a fairly innovative concept which permits neural networks to function on random graphs. As unbounded problem structures are universal in real-world scenarios and can be best denoted by graphs, Graph Neural Networks suggests new exhilarating applications and further simplified latent for machine learning wholly, but also noteworthy enhancement of performance in a deep learning domain. Graph Neural Networks are variant of Graph convolution networks can function sprightly on graphs. One of the well-known tasks attempted with this new skill is graph partitioning. Important characteristic of community is to discover graph nodes are with same interests and keep them strongly connected to extract groups for numerous reasons. We demonstrate a semi-supervised learning on graph data for solving community detection. In a number of trials on graph partitions we proved that our framework outperforms traditional ones.","PeriodicalId":262409,"journal":{"name":"2022 First International Conference on Artificial Intelligence Trends and Pattern Recognition (ICAITPR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 First International Conference on Artificial Intelligence Trends and Pattern Recognition (ICAITPR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAITPR51569.2022.9844211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The Graph Neural Network is a fairly innovative concept which permits neural networks to function on random graphs. As unbounded problem structures are universal in real-world scenarios and can be best denoted by graphs, Graph Neural Networks suggests new exhilarating applications and further simplified latent for machine learning wholly, but also noteworthy enhancement of performance in a deep learning domain. Graph Neural Networks are variant of Graph convolution networks can function sprightly on graphs. One of the well-known tasks attempted with this new skill is graph partitioning. Important characteristic of community is to discover graph nodes are with same interests and keep them strongly connected to extract groups for numerous reasons. We demonstrate a semi-supervised learning on graph data for solving community detection. In a number of trials on graph partitions we proved that our framework outperforms traditional ones.