journal article·2022-01-17Open access

The Status and Trend of Chinese News Forecast Based on Graph Convolutional Network Pooling Algorithm

Xiao Han, Jing Peng, Tailai Peng, Rui Chen, Boyuan Hou, Xinran Xie, Zhe Cui

Applied Sciences· Volume 12· Issue 2

Abstract

It is always a hot issue in the intelligence analysis field to predict the trend of news description by pre-trained language models and graph neural networks. However, there are several problems in the existing research: (1) there are few Chinese data sets on this subject in academia and industry; and (2) using the existing pre-trained language models and graph classification algorithms cannot achieve satisfactory results. The method described in this paper can better solve these problems. (1) We built a Chinese news database predicted by more than 9000 annotated news time trends, filling the gaps in this database. (2) We designed an improved method based on the pre-trained language model and graph neural networks pooling algorithm. In the graph pooling algorithm, the Graph U-Nets Pooling method and self-attention are combined, which can better solve the analysis of the problem of forecasting the development trend of news events. The experimental results show that the effect of this method compared with the baseline graph classification algorithm is improved, and it also solves the shortcomings of the pre-trained language model that cannot handle very long texts. Therefore, it can be concluded that our research has strong processing capabilities for analyzing and predicting the development trend of Chinese news events.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Advanced Graph Neural Networks · Complex Network Analysis Techniques · Topic Modeling

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Chengdu Institute of Computer Applications, Chinese Academy of Sciences, Chengdu 610041, China

University of Chinese Academy of Sciences, Beijing 100049, China

School of Computer Science, Chengdu University of Information Technology, Chengdu 610225, China

References (21)

Show source-provided references
1. Senior, A., Jumper, J., Hassabis, D., and Kohli, P. (2022, January 09). AlphaFold: Using AI for Scientific Discovery. DeepMind. Available online: https://deepmind.com/blog/alphafold.
2. Multi-component Spatial-tempoal Graph Convolution Networks for Traffic Flow Forecasting
3. Huang, J., Zhan, G., Fan, Q., Mo, K., Shao, L., Chen, B., Guibas, L., and Dong, H. (2020). Generative 3d part assembly via dynamic graph learning. arXiv.
4. Wang, H., Zhang, F., Zhang, M., Leskovec, J., Zhao, M., Li, W., and Wang, Z. (2019, January 4–8). Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems. Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2019): n. pag, Anchorage, AK, USA.10.1145/3292500.3330836 ↗
5. Yao, L., Mao, C., and Luo, Y. (February, January 27). Graph convolutional networks for text classification. Proceedings of the AAAI Conference on Artificial Intelligence, Honolulu, HI, USA.
6. Peters, M.E., Neumann, M., Iyyer, M., Gardner, M., Clark, C., Lee, K., and Zettlemoyer, L. (2018). Deep contextualized word representations. arXiv.10.18653/v1/N18-1202 ↗
7. Radford, A., Narasimhan, K., Salimans, T., and Sutskever, I. (2021, November 14). Improving Language Understanding by Generative Pre-Training. Available online: https://s3-us-west-2.amazonaws.com/openai-assets/research-covers/language-unsupervised/language_understanding_paper.pdf.
8. Language models are unsupervised multitask learners
9. Brown, T.B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., and Askell, A. (2020). Language models are few-shot learners. arXiv.
10. Devlin, J., Chang, M.W., Lee, K., and Toutanova, K. (2018). Bert: Pre-training of deep bidirectional transformers for language understanding. arXiv.
11. Aswani, A.V., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, L., and Polosukhin, I. (2017). Attention is all you need. Advances in Neural Information Processing Systems, Available online: https://proceedings.neurips.cc/paper/2017/file/3f5ee243547dee91fbd053c1c4a845aa-Paper.pdf.
12. (2021, November 08). GitHub—Liuhuanyong/TextGrapher: Text Content Grapher Based on Keyinfo Extraction by NLP Method. Available online: https://github.com/liuhuanyong/TextGrapher.
13. Cui, Y., Che, W., Liu, T., Qin, B., Yang, Z., Wang, S., and Hu, G. (2019). Pre-training with whole word masking for Chinese bert. arXiv.
14. Kipf, T.N., and Welling, M. (2017). Semi-supervised classification with graph convolutional networks. arXiv.
15. The Graph Neural Network Model10.1109/TNN.2008.2005605 ↗
16. (2021, November 08). GitHub—Hanxiao/Bert-as-Service: Mapping a Variable-Length Sentence to a Fixed-Length Vector Using BERT Model. Available online: https://github.com/hanxiao/bert-as-service.
17. Zhang, M., Cui, Z., Neumann, M., and Chen, Y. (2018). An end-to-end deep learning architecture for graph classification. Thirty-Second AAAI Conference on Artificial Intelligence, Available online: https://ojs.aaai.org/index.php/AAAI/article/view/11782.10.1609/aaai.v32i1.11782 ↗
18. Ying, R., You, J., Morris, C., Ren, X., Hamilton, W.L., and Leskovec, J. (2018). Hierarchical graph representation learning with differentiable pooling. arXiv.
19. Gao, H., and Ji, S. (2019). Graph u-nets. International Conference on Machine Learning, Available online: http://proceedings.mlr.press/v97/gao19a/gao19a.pdf.
20. Lee, J., Lee, I., and Kang, J. (2019). Self-attention graph pooling. International Conference on Machine Learning, Available online: http://proceedings.mlr.press/v97/lee19c.html.
21. Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R.R., and Le, Q.V. (2019). Xlnet: Generalized autoregressive pretraining for language understanding. Advances in Neural Information Processing Systems, Available online: https://proceedings.neurips.cc/paper/2019/hash/dc6a7e655d7e5840e66733e9ee67cc69-Abstract.html.