Abstract
In recent years, graph convolutional networks (GCNs) have gained widespread attention and applications in image classification tasks. While traditional convolutional neural networks (CNNs) usually represent images as a two-dimensional grid of pixels when processing image data, the classical model of graph neural networks (GNNs), GCNs, can effectively handle data with graph structure, such as social networks, recommender systems, and molecular structures. In this paper, we will introduce the problems that graph convolutional networks have had, such as over-smoothing, and the methods to solve them, and suggest some possible future directions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
