Graph regularization-based methods have achieved great success for network classification by making the label-link consistency assumption, i.e., if two nodes are linked together, they are likely to belong to the same class. However, in a real-world network, there exist links that connect nodes of different classes. These inconsistent links raise a big challenge for graph regularization and deteriorate the classification performance significantly. To address this problem, we propose a novel algorithm, namely Consistent Graph Learning, which is robust to the inconsistent links of a network. In particular, given a network and a small number of labeled nodes, we aim at learning a consistent network with more consistent and fewer inconsistent links than the original network. Since the link information of a network is naturally represented by a set of relation matrices, the learning of a consistent network is reduced to learning consistent relation matrices under some constraints. More specifically, we achieve it by joint graph regularization on the nuclear norm minimization of consistent relation matrices together with ℓ1-norm minimization on the difference matrices between the original relation matrices and the learned consistent ones subject to certain constraints. Experiments on both homogeneous and heterogeneous network datasets show that the proposed method outperforms the state-of-the-art methods.
Keywords: Consistent Graph Learning; Consistent Link; Consistent Network; Information Network; Robust Classification.
L1-norm locally linear representation regularization multi-source adaptation learning.Neural Netw. 2015 Sep;69:80-98. doi: 10.1016/j.neunet.2015.01.009. Epub 2015 Feb 25. Neural Netw. 2015. PMID: 26091754
Multiple Structure-View Learning for Graph Classification.IEEE Trans Neural Netw Learn Syst. 2018 Jul;29(7):3236-3251. doi: 10.1109/TNNLS.2017.2703832. Epub 2017 Sep 20. IEEE Trans Neural Netw Learn Syst. 2018. PMID: 28945603
Constrained Active Learning for Anchor Link Prediction Across Multiple Heterogeneous Social Networks.Sensors (Basel). 2017 Aug 3;17(8):1786. doi: 10.3390/s17081786. Sensors (Basel). 2017. PMID: 28771201 Free PMC article.
Deep Network Embedding for Graph Representation Learning in Signed Networks.IEEE Trans Cybern. 2020 Apr;50(4):1556-1568. doi: 10.1109/TCYB.2018.2871503. Epub 2018 Oct 9. IEEE Trans Cybern. 2020. PMID: 30307885
Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering.IEEE Trans Cybern. 2017 Apr;47(4):1053-1066. doi: 10.1109/TCYB.2016.2536752. Epub 2016 Mar 15. IEEE Trans Cybern. 2017. PMID: 26992192