Abstract
The feature information of the local graph structure and the nodes may be over-smoothing due to the large number of encodings, which causes the node characterization to converge to one or several values. In other words, nodes from different clusters become difficult to distinguish, as two different classes of nodes with closer topological distance are more likely to belong to the same class and vice versa. To alleviate this problem, an over-smoothing algorithm is proposed, and a method of reweighted mechanism is applied to make the trade-off of the information representation of nodes and neighborhoods more reasonable. By improving several propagation models, including Chebyshev polynomial kernel model and Laplace linear 1st Chebyshev kernel model, a new model named RWGCN based on different propagation kernels was proposed logically. The experiments show that satisfactory results are achieved on the semi-supervised classification task of graph type data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bruna, J., Zaremba, W., Szlam, A., LeCun, Y.: Spectral networks and locally connected networks on graphs. In: Proceedings of International Conference on Learning Representations, pp. 253–267 (2014)
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: NIPS, vol. 14, pp. 585–591 (2001)
Coifman, R.R., Maggioni, M.: Diffusion wavelets. Appl. Comput. Harm. Anal. 21(1), 53–94 (2006)
Niepert, M., Ahmed, M., Kutzkov, K.: Learning convolutional neural networks for graphs. In: Proceedings of the International Conference on Machine Learning, pp. 2014–2023 (2016)
Berkholz, C., Bonsma, P.S., Grohe, M.: Tight lower and upper bounds for the complexity of canonical colour refinement. In: Proceedings of the European Symposium on Algorithms, pp. 145–156 (2013)
Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. In: Proceedings of the International Conference on Learning Representations, pp. 23–37 (2017)
Hammond, D.K., Vandergheynst, P., Gribonval, R.: Wavelets on graphs via spectral graph theory. Appl. Comput. Harmonic Anal. 30, 129–150 (2011)
Hilton, M.: Wavelet and wavelet packet compression of electrocardiograms. IEEE Trans. Biomed. Eng. 44, 394–402 (1997)
Sendur, L., Selesnick, I.: Bivariate shrinkage functions for wavelet-based denoising exploiting interscale dependency. IEEE Trans. Signal Process. 50, 2744–2756 (2002)
Chen, Z.M., Wei, X.S., Wang, P.: Multi-Label Image Recognition with Graph Convolutional Networks, pp. 23–45 (2019)
Ge, W., Yang, S., Yu, Y.: Multi-evidence filtering and fusion for multi-label classification, object detection and semantic segmentation based on weakly supervised learning. In: CVPR, pp. 1277–1286 (2018)
Lee, C.-W., Fang, W., Yeh, C.-K., Frank Wang, Y.C.: Multi-label zero-shot learning with structured knowledge graphs. In: CVPR, pp. 1576–1585 (2018)
Li, X., Zhao, F., Guo, Y.: Multi-label image classification with a probabilistic label enhancement model. In: UAI, pp. 1–10 (2014)
Zhu, X., Ghahramani, Z., Lafferty, J.: Semi-supervised learning using gaussian fields and harmonic functions. In: International Conference on Machine Learning (ICML), vol. 3, pp. 912–919 (2003)
Belkin, M., Niyogi, P., Sindhwani, V.: Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. J. Mach. Learn. Res. (JMLR) 7, 2399–2434 (2006)
Weston, J., Ratle, F., Mobahi, H., Collobert, R.: Deep learning via semi-supervised embedding. In: Montavon, G., Orr, G.B., Müller, K.-R. (eds.) Neural Networks: Tricks of the Trade. LNCS, vol. 7700, pp. 639–655. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35289-8_34
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E.R., Mitchell, T.M.: Toward an architecture for never-ending language learning. In: AAAI, vol. 5, pp. 3–12 (2010)
Yang, Z., Cohen, W., Salakhutdinov, R.: Revisiting semi-supervised learning with graph embeddings. In: International Conference on Machine Learning (ICML) (2016)
Kingma, D., Ba, J.: Adam: a method for stochastic optimization. In: Computer Science, pp. 256–278 (2014)
Glorot, X., Bengio, Y.: Understanding the difficulty of training deep feedforward neural networks. In: AISTATS, vol. 9, pp. 249–256 (2010)
Perozzi, B., Al-Rfou, R., Skiena, S.: Online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)
Joachims, T.: Transductive inference for text classification using support vector machines. In: International Conference on Machine Learning (ICML), vol. 99, pp. 200–209 (1999)
Lu, Q., Getoor, L.: Link-based classification. In: International Conference on Machine Learning (ICML), vol. 3, pp. 496–503 (2003)
Sen, P., Namata, G., Bilgic, M., Galligher, B., Eliassi-Rad, T.: Collective classification in network data. AI Mag. 29, 93 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dai, M., Guo, W., Feng, X. (2020). Over-Smoothing Algorithm and Its Application to GCN Semi-supervised Classification. In: Qin, P., Wang, H., Sun, G., Lu, Z. (eds) Data Science. ICPCSEE 2020. Communications in Computer and Information Science, vol 1258. Springer, Singapore. https://doi.org/10.1007/978-981-15-7984-4_16
Download citation
DOI: https://doi.org/10.1007/978-981-15-7984-4_16
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-7983-7
Online ISBN: 978-981-15-7984-4
eBook Packages: Computer ScienceComputer Science (R0)