Heterogeneous Graph-Convolution-Network-Based Short-Text Classification
Source abstract
Abstract
With the development of online interactive media platforms, a large amount of short text has appeared on the internet. Determining how to classify these short texts efficiently and accurately is of great significance. Graph neural networks can capture information dependencies in the entire short-text corpus, thereby enhancing feature expression and improving classification accuracy. However, existing works have overlooked the role of entities in these short texts. In this paper, we propose a heterogeneous graph-convolution-network-based short-text classification (SHGCN) method that integrates heterogeneous graph convolutional neural networks of text, entities, and words. Firstly, the model constructs a graph network of the text and extracts entity nodes and word nodes. Secondly, the relationship of the graph nodes in the heterogeneous graphs is determined by the mutual information between the words, the relationship between the documents and words, and the confidence between the words and entities. Then, the feature is represented through a word graph and combined with its BERT embedding, and the word feature is strengthened through BiLstm. Finally, the enhanced word features are combined with the document graph representation features to predict the document categories. To verify the performance of the model, experiments were conducted on the public datasets AGNews, R52, and MR. The classification accuracy of SHGCN reached 88.38%, 93.87%, and 82.87%, respectively, which is superior to that of some existing advanced classification methods.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Topic Modeling · Advanced Text Analysis Techniques · Text and Document Classification Technologies
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
The School of Computer and Information Engineering, Tianjin Normal University, Tianjin 300387, China
Funding
Special Project on Network Security and Information Construction of Tianjin Normal University
References (26)
Show source-provided references
1. Wang, F., Wang, Z.Y., and Li, Z.J. (2014, January 3–7). Concept-based short text classification and ranking. Proceedings of the 23rd ACM International Conference on Information and Knowledge Management, Shanghai, China.10.1145/2661829.2662067 ↗
2. SATNet: Symmetric adversarial transfer network based on two-level alignment strategy towards cross-domain sentiment classification
3. Using Logistic regression model for Chinese text categorization
4. Libsvm10.1145/1961189.1961199 ↗
5. Kim, Y. (2014, January 25–29). Convolutional neural networks for sentence classification. Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), Doha, Qatar.10.3115/v1/D14-1181 ↗
6. Harris, Z.S. (1981). Distributional Structure, Reidel Publishing Company.10.1007/978-94-009-8467-7_1 ↗
7. Wang, S.I., and Manning, C.D. (2012, January 8–14). Baselines and bigrams: Simple, good sentiment and topic classification. Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, Jeju, Republic of Korea.
8. Wallach, H.M. (2006, January 25–29). Topic modeling: Beyond bag-of-words. Proceedings of the 23rd International Conference on Machine Learning-ICML’06, Pittsburgh, PA, USA.10.1145/1143844.1143967 ↗
9. Greedy function approximation: A gradient boosting machine10.1214/aos/1013203451 ↗
10. Long short-term memory10.1162/neco.1997.9.8.1735 ↗
11. Zeng, J.C., Li, J., Song, Y., Gao, C., Lyu, M.R., and King, I. (2018). Topic memory networks for short text classification. arXiv.10.18653/v1/D18-1351 ↗
12. Li, M.C., Clinton, G., Miao, Y.J., and Gao, F. (2021). Short text classification via knowledge powered attention with similarity matrix based CNN. arXiv.
13. Kipf, T.N., and Welling, M. (2017). Semi-supervised classification with graph convolutional networks. arXiv.
14. Graph convolutional networks for text classification
15. Liu, X.E., You, X.X., Zhang, X., Wu, J., and Lv, P. (2020, January 7–12). Tensor graph convolutional net- works for text classification. Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, New York, NY, USA.
16. HGAT: Heterogeneous graph attention networks for semi-supervised short text classification10.1145/3450352 ↗
17. Piao, Y., Lee, S., Lee, D., and Kim, S. (2020, January 7–14). Sparse structure learning via graph neural networks for inductive document classification. Proceedings of the 34th AAAI Conference on Artificial Intelligence, New York, NY, USA.
18. BAG: Text Classification Based on Attention Mechanism Combining BERT and GCN
19. A Semi-supervised Short Text Classification Based on Multi-grained Graphs and Attention Mechanism
20. Short text classification method by fusing corpus features and graph attention network
21. Linmei, H., Yang, T., Shi, C., Ji, H., and Li, X. (2019, January 28). Heterogeneous Graph Attention Networks for Semi-supervised Short Text Classification. Proceedings of the Empirical Methods in Natural Language Processing Association for Computational Linguistics, Florence, Italy.10.18653/v1/D19-1488 ↗
22. A survey of word embeddings based on deep learning10.1007/s00607-019-00768-7 ↗
23. Mikolov, T., Chen, K., Corrado, G., and Dean, J. (2013). Efficient estimation of word representations in vector space. arXiv.
24. Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., and Dean, J. (2013). Distributed representations of words and phrases and their compositionality. arXiv.
25. Pennington, J., Socher, R., and Manning, C. (2014, January 25–29). Glove: Global vectors for word representation. Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), Doha, Qatar.10.3115/v1/D14-1162 ↗
26. Joulin, A., Grave, E., Bojanowski, P., and Mikolov, T. (2017, January 3–7). Bag of tricks for efficient text classification. Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, Valencia, Spain.10.18653/v1/E17-2068 ↗