Noise-robust classification with hypergraph neural network

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a novel version of hypergraph neural network method. This method is utilized to solve the noisy label learning problem. First, we apply the PCA dimensional reduction technique to the feature matrices of the image datasets in order to reduce the “noise” and the redundant features in the feature matrices of the image datasets and to reduce the runtime constructing the hypergraph of the hypergraph neural network method. Then, the classic graph based semisupervised learning method, the classic hypergraph based semi-supervised learning method, the graph neural network, the hypergraph neural network, and our proposed hypergraph neural network are employed to solve the noisy label learning problem. The accuracies of these five methods are evaluated and compared. Experimental results show that the hypergraph neural network methods achieve the best performance when the noise level increases. Moreover, the hypergraph neural network methods are at least as good as the graph neural network.

Cite

CITATION STYLE

APA

Vu Dang, N. T., Tran, L., & Tran, L. (2021). Noise-robust classification with hypergraph neural network. Indonesian Journal of Electrical Engineering and Computer Science, 21(3), 1465–1473. https://doi.org/10.11591/ijeecs.v21.i3.pp1465-1473

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free