GRNN: Graph-Retraining Neural Network for Semi-Supervised Node Classification

نویسندگان

چکیده

In recent years, graph neural networks (GNNs) have played an important role in representation learning and successfully achieved excellent results semi-supervised classification. However, these GNNs often neglect the global smoothing of because is incompatible with node Specifically, a cluster nodes has small number other classes nodes. To address this issue, we propose graph-retraining network (GRNN) model that performs over by alternating between procedure inference procedure, based on key idea expectation-maximum algorithm. Moreover, error combined cross-entropy to form loss function GRNN, which effectively solves problem. The experiments show GRNN achieves high accuracy standard citation datasets, including Cora, Citeseer, PubMed, proves effectiveness

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Partition Neural Networks for Semi-Supervised Classification

We present graph partition neural networks (GPNN), an extension of graph neural networks (GNNs) able to handle extremely large graphs. GPNNs alternate between locally propagating information between nodes in small subgraphs and globally propagating information between the subgraphs. To efficiently partition graphs, we experiment with several partitioning algorithms and also propose a novel vari...

متن کامل

Attention-based Graph Neural Network for Semi-supervised Learning

Recently popularized graph neural networks achieve the state-of-the-art accuracy on a number of standard benchmark datasets for graph-based semi-supervised learning, improving significantly over existing approaches. These architectures alternate between a propagation layer that aggregates the hidden states of the local neighborhood and a fully-connected layer. Perhaps surprisingly, we show that...

متن کامل

Accurate Semi-supervised Classification for Graph Data

Most machine learning algorithms require labeled instances as training data; however, not all instances are equally easy to obtain labels for. For example, the best-known papers and/or websites would be easier for a domain expert to label. We propose a new PageRank-style method for performing semi-supervised learning by propagating labels from labeled seed instances to unlabeled instances in a ...

متن کامل

Supervised neighborhood graph construction for semi-supervised classification

Graph based methods are among the most active and applicable approaches studied in semi-supervised learning. The problem of neighborhood graph construction for these methods is addressed in this paper. Neighborhood graph construction plays a key role in the quality of the classification in graph based methods. Several unsupervised graph construction methods have been proposed that have addresse...

متن کامل

Semi-Supervised Classification Based on Mixture Graph

Graph-based semi-supervised classification heavily depends on a well-structured graph. In this paper, we investigate a mixture graph and propose a method called semi-supervised classification based on mixture graph (SSCMG). SSCMG first constructs multiple k nearest neighborhood (kNN) graphs in different random subspaces of the samples. Then, it combines these graphs into a mixture graph and inc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algorithms

سال: 2023

ISSN: ['1999-4893']

DOI: https://doi.org/10.3390/a16030126