{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T12:18:02Z","timestamp":1771935482486,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:00:00Z","timestamp":1660262400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076155"],"award-info":[{"award-number":["62076155"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["201901D111029"],"award-info":[{"award-number":["201901D111029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["62076155"],"award-info":[{"award-number":["62076155"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["201901D111029"],"award-info":[{"award-number":["201901D111029"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In recent years, graph neural network algorithm (GNN) for graph semi-supervised classification has made great progress. However, in the task of node classification, the neighborhood size is often difficult to expand. The propagation of nodes always only considers the nearest neighbor nodes. Some algorithms usually approximately classify by message passing between direct (single-hop) neighbors. This paper proposes a simple and effective method, named Graph Mixed Random Network Based on PageRank (PMRGNN) to solve the above problems. In PMRGNN, we design a PageRank-based random propagation strategy for data augmentation. Then, two feature extractors are used in combination to supplement the mutual information between features. Finally, a graph regularization term is designed, which can find more useful information for classification results from neighbor nodes to improve the performance of the model. Experimental results on graph benchmark datasets show that the method of this paper outperforms several recently proposed GNN baselines on the semi-supervised node classification. In the research of over-smoothing and generalization, PMRGNN always maintains better performance. In classification visualization, it is more intuitive than other classification methods.<\/jats:p>","DOI":"10.3390\/sym14081678","type":"journal-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T23:44:03Z","timestamp":1660607043000},"page":"1678","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph Mixed Random Network Based on PageRank"],"prefix":"10.3390","volume":"14","author":[{"given":"Qianli","family":"Ma","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan 030006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan 030006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenzhi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan 030006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongye","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan 030006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,8,12]]},"reference":[{"key":"ref_1","unstructured":"Kipf, T.N., and Welling, M. (2017, January 24\u201326). Semi-supervised classification with graph convolutional networks. Proceedings of the 5th International Conference on Learning Representations (ICLR), Toulon, France."},{"key":"ref_2","unstructured":"Abu-El-Haija, S., Perozzi, B., Kapoor, A., Alipourfard, N., Lerman, K., Harutyunyan, H., Steeg, G.V., and Galstyan, A. (2019, January 9\u201315). Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing. Proceedings of the 36th International Conference on Machine Learning, Long Beach, CA, USA."},{"key":"ref_3","unstructured":"Rong, Y., Huang, W., Xu, T., and Huang, J. (2019, January 6\u20139). DropEdge: Towards Deep Graph Convolutional Networks on Node Classification. Proceedings of the 7th International Conference on Learning Representations, New Orleans, LA, USA."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Luo, D., Cheng, W., Yu, W., Zong, B., Ni, J., and Chen, H. (2021, January 8\u201312). Learning to Drop: Robust Graph Neural Network via Topological Denoising. Proceedings of the 14th ACM International Conference on Web Search and Data Mining, Online.","DOI":"10.1145\/3437963.3441734"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Chen, D., Lin, Y., Li, W., Li, P., Zhou, J., and Sun, X. (2020, January 7). Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological View. Proceedings of the 34th AAAI Conference on Artificial Intelligence, New York, NY, USA.","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref_6","unstructured":"Zhao, T., Liu, Y., Neves, L., Woodford, O., Jiang, M., and Shah, N. (2020, January 7). Data Augmentation for Graph Neural Networks. Proceedings of the 34th AAAI Conference on Artificial Intelligence, New York, NY, USA."},{"key":"ref_7","unstructured":"Klicpera, J., Weienberger, S., and G\u00fcnnemann, S. (2019, January 8\u201314). Diffusion Improves Graph Learning. Proceedings of the 2019 Conference and Workshop on Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Xu, B., Shen, H., Cao, Q., Cen, K., and Cheng, X. (2019, January 10\u201316). Graph Convolutional Networks using Heat Kernel for Semi-supervised Learning. Proceedings of the 33th International Joint Conference on Artificial Intelligence, Macao, China.","DOI":"10.24963\/ijcai.2019\/267"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Jiang, B., Lin, D., Tang, J., and Luo, B. (2019, January 16). Data Representation and Learning with Graph Diffusion-Embedding Networks. Proceedings of the 2019 IEEE Conference on Computer Vision and Pattern Recognition, Long Beach, CA, USA.","DOI":"10.1109\/CVPR.2019.01066"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., and M\u00fcller, E. (2018, January 23\u201327). VERSE: Versatile Graph Embeddings from Similarity Measures. Proceedings of the 2018 World Wide Web Conference, Lyon, France.","DOI":"10.1145\/3178876.3186120"},{"key":"ref_11","unstructured":"Klicpera, J., Bojchevski, A., and G\u00fcnnemann, S. (2019, January 6\u20139). Combining Neural Networks with Personalized PageRank for Classification on Graphs. Proceedings of the 7th International Conference on Learning Representations, New Orleans, LA, USA."},{"key":"ref_12","unstructured":"Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., and Wang, L. (2020, January 8\u201311). Deep Graph Contrastive Representation Learning. Proceedings of the 2020 International Conference on Machine Learning, Dublin, Ireland."},{"key":"ref_13","unstructured":"You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., and Shen, Y. (2020, January 6). Graph Contrastive Learning with Augmentations. Proceedings of the 2020 Conference and Workshop on Neural Information Processing Systems, Online."},{"key":"ref_14","unstructured":"Li, J., Zhou, P., Xiong, C., and Hoi, S.C. (2021, January 3\u20137). Prototypical Contrastive Learning of Unsupervised Representations. Proceedings of the 9th International Conference on Learning Representations, Online."},{"key":"ref_15","unstructured":"Kang, B., Li, Y., Xie, S., Yuan, Z., and Feng, J. (2021, January 3\u20137). Exploring balanced feature spaces for representation learning. Proceedings of the 9th International Conference on Learning Representations, Online."},{"key":"ref_16","unstructured":"Xie, Q., Dai, Z., Hovy, E., Luong, T., and Le, Q. (2020, January 6). Unsupervised data augmentation for consistency training. Proceedings of the 2020 Conference and Workshop on Neural Information Processing Systems, Online."},{"key":"ref_17","unstructured":"Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K., and Jegelka, S. (May, January 30). Representation Learning on Graphs with Jumping Knowledge Networks. Proceedings of the 6th International Conference on Learning Representations, Vancouver, BC, Canada."},{"key":"ref_18","unstructured":"Wu, F., Souza, A., Zhang, T., Fifty, C., Yu, T., and Weinberger, K. (2019, January 12). Simplifying graph convolutional networks. Proceedings of the 2019 International Conference on Machine Learning, Long Beach, CA, USA."},{"key":"ref_19","unstructured":"Zhu, H., and Koniusz, P. (2021, January 3\u20137). Simple spectral graph convolution. Proceedings of the 9th International Conference on Learning Representations, Online."},{"key":"ref_20","unstructured":"Page, L., Brin, S., Motwani, R., and Winograd, T. (1999). The pagErank Citation Ranking: Bringing Order to the Web, Stanford InfoLab. Available online: http:\/\/ilpubs.stanford.edu:8090\/422\/1\/1999-66.pdf."},{"key":"ref_21","unstructured":"Kondor, R., and Lafferty, J. (2002, January 13). Diffusion Kernels on Graphs and Other Discrete Structures. Proceedings of the 2002 International Conference on Machine Learning, Sydney, Australia."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1146\/annurev.soc.27.1.415","article-title":"Birds of a feather: Homophily in social networks","volume":"27","author":"McPherson","year":"2001","journal-title":"Annu. Rev. Sociol."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Verma, V., Qu, M., Kawaguchi, K., Lemb, A., Bengio, Y., Kannala, J., and Tang, J. (2021, January 2). GraphMix: Improved Training of GNNs for Semi-Supervised Learning. Proceedings of the 35th AAAI Conference on Artificial Intelligence, Online.","DOI":"10.1609\/aaai.v35i11.17203"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/978-3-642-35289-8_34","article-title":"Deep learning via semi-supervised embedding","volume":"7700","author":"Weston","year":"2012","journal-title":"Neural Netw. Tricks Trade"},{"key":"ref_25","unstructured":"Zhu, X., Ghahramani, Z., and Lafferty, J.D. (2003, January 1\u201324). Semi-supervised learning using gaussian fields and harmonic functions. Proceedings of the 20th International Conference on Machine Learning, Washington, DC, USA."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Zhu, M., Wang, X., Shi, C., Ji, H., and Cui, P. (2021, January 12\u201323). Interpreting and unifying graph neural networks with an optimization framework. Proceedings of the 30th Web Conference, Ljubljana, Slovenia.","DOI":"10.1145\/3442381.3449953"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Yang, H., Ma, K., and Cheng, J. (2021, January 2). Rethinking Graph Regularization for Graph Neural Networks. Proceedings of the 35th AAAI Conference on Artificial Intelligence, Online.","DOI":"10.1609\/aaai.v35i5.16586"},{"key":"ref_28","unstructured":"Gilmer, J., Schoenholz, S.S., Riley, P.F., Vinyals, O., and Dahl, G.E. (2017, January 6\u201311). Neural message passing for quantum chemistry. Proceedings of the the 34th International Conference on Machine Learning, Sydney, NSW, Australia."},{"key":"ref_29","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., and Bengio, Y. (May, January 30). Graph attention networks. Proceedings of the 6th International Conference on Learning Representations, Vancouver, BC, Canada."},{"key":"ref_30","unstructured":"Yang, Z., Cohen, W., and Salakhudinov, R. (2016, January 19\u201324). Revisiting semi-supervised learning with graph embeddings. Proceedings of the 2016 International Conference on Machine Learning, New York, NY, USA."},{"key":"ref_31","unstructured":"Chien, E., Peng, J., Li, P., and Milenkovic, O. (2020, January 26). Adaptive universal generalized PageRank graph neural network. Proceedings of the 8th International Conference on Learning Representations, Addis Ababa, Ethiopia."},{"key":"ref_32","unstructured":"Chen, M., Wei, Z., Huang, Z., Ding, B., and Li, Y. (2020, January 13\u201318). Simple and deep graph convolutional networks. Proceedings of the 37th International Conference on Machine Learning, New Orleans, LA, USA."},{"key":"ref_33","unstructured":"Hamilton, W.L., Ying, R., and Leskovec, J. (2017, January 8\u201314). Inductive representation learning on large graphs. Proceedings of the 31st Conference on Neural Information Processing Systems, Long Beach, CA, USA."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/8\/1678\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:07:46Z","timestamp":1760141266000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/8\/1678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,12]]},"references-count":33,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2022,8]]}},"alternative-id":["sym14081678"],"URL":"https:\/\/doi.org\/10.3390\/sym14081678","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,12]]}}}