Guangyong Xi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Guangyong Xi has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Baohua Qiang
Guangxi Key Laboratory of Image and Graphic Intelligent Processing, Guilin University of Electronic Technology, Guilin, China
3 shared publications - Xianyi Yang
Guangxi Key Laboratory of Image and Graphic Intelligent Processing, Guilin University of Electronic Technology, Guilin, China
3 shared publications - Pingping Sun
Guangxi Key Laboratory of Image and Graphic Intelligent Processing, Guilin University of Electronic Technology, China
1 shared publication - Ruidong Chen
Guangxi Key Laboratory of Image and Graphic Intelligent Processing, Guilin University of Electronic Technology, Guilin, China
1 shared publication - Shihao Zhang
Guangxi Key Laboratory of Image and Graphic Intelligent Processing, Guilin University of Electronic Technology, Guilin, China
1 shared publication - Shuiping Guo
The 7th Research Institute of CETC, China
1 shared publication
Latest Publications
- Open Access
- 27 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 469-474
Multi-perspective Text Matching Algorithm Based on Multi-granularity Feature Convolution
The core of Chinese text matching task lies in mining the deep semantic information inside the text, exploring the semantic similarities and differences between different texts, and then analyzing the semantic similarity between two texts to be matched. To address the problems of single text granularity feature, insufficient capture of potential semantic information at multiple granularities and weak interactive matching of coding features in Chinese text matching, we propose a multi-perspective text matching model based on multi-granularity features convolution (MpmMfc). The model first extracts characters, words and associated phrases by multi-pattern partitioning and performs initial encoding, then uses a two-way gate loop control unit to initially extract the contextual semantic information in the encoding. Then a multi-grain size high-dimensional encoding matrix is constructed and convolutional neural network is used to capture the granularity features to improve the characterization of multi-granularity semantic information. Finally, the multi-granularity convolutional matrices of two texts are cross-cosine matched by multi-perspective matching patterns to enhance the interaction strength of multi-granularity feature information. The results achieved in the experiments of LCQMC, a spoken expression class dataset, and BQ, a financial class dataset, are better than the currently available non-BERT type text matching models.
- 27 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 469-474
Open AccessMulti-perspective Text Matching Algorithm Based on Multi-granularity Feature Convolution
The core of Chinese text matching task lies in mining the deep semantic information inside the text, exploring the semantic similarities and differences between different texts, and then analyzing the semantic similarity between two texts to be matched. To address the problems of single text granularity feature, insufficient capture of potential semantic information at multiple granularities and weak interactive matching of coding features in Chinese text matching, we propose a multi-perspective text matching model based on multi-granularity features convolution (MpmMfc). The model first extracts characters, words and associated phrases by multi-pattern partitioning and performs initial encoding, then uses a two-way gate loop control unit to initially extract the contextual semantic information in the encoding. Then a multi-grain size high-dimensional encoding matrix is constructed and convolutional neural network is used to capture the granularity features to improve the characterization of multi-granularity semantic information. Finally, the multi-granularity convolutional matrices of two texts are cross-cosine matched by multi-perspective matching patterns to enhance the interaction strength of multi-granularity feature information. The results achieved in the experiments of LCQMC, a spoken expression class dataset, and BQ, a financial class dataset, are better than the currently available non-BERT type text matching models.
- Open Access
- 15 April 2023
- Published by Wiley in Mobile Information Systems
- Vol. 2023, 1-9
Siamese Interaction and Fine-Tuning Representation of Chinese Semantic Matching Algorithm Based on RoBERTa-wwm-ext
Semantic matching research is the cornerstone of research in the fields of natural language similarity measurement and sensor ontology matching (OM). In the existing Chinese semantic matching methods, there are some shortcomings, such as the single dimension of semantic expression, the insufficient expression of context semantic relations, and the insufficient interaction of semantic information between different sentences. This paper proposes a Chinese semantic matching algorithm based on RoBERTa-wwm-ext with Siamese interaction and fine-tuning representation (RSIFR). The RSIFR model initializes the model with RoBERTa-wwm-ext as a vector of text. Firstly, a Siamese structure with embedded soft alignment attention mechanism and BiLSTM is constructed to realize the information interaction between two sentences. Secondly, LSTM-BiLSTM network structure is constructed to enhance the expression of semantic logic before and after sentences. Then, build a training model with fine-tuning mechanism. Fine tune the text’s eigenvector parameters through label supervision. Finally, the fusion vectors of the sentence pairs are inserted into the MLP network layer, resulting in semantic matching results. RSIFR model starts from a variety of dimensions, strengthens the expression ability of vectors to text semantic relations, deeply mines the semantic similarities and differences between different sentences, and generally improves the Chinese semantic matching performance. Experiments on the public dataset LCQMC show that our model outperforms existing Chinese semantic matching models.
- 15 April 2023
- Published by Wiley in Mobile Information Systems
- Vol. 2023, 1-9
Open AccessSiamese Interaction and Fine-Tuning Representation of Chinese Semantic Matching Algorithm Based on RoBERTa-wwm-ext
Semantic matching research is the cornerstone of research in the fields of natural language similarity measurement and sensor ontology matching (OM). In the existing Chinese semantic matching methods, there are some shortcomings, such as the single dimension of semantic expression, the insufficient expression of context semantic relations, and the insufficient interaction of semantic information between different sentences. This paper proposes a Chinese semantic matching algorithm based on RoBERTa-wwm-ext with Siamese interaction and fine-tuning representation (RSIFR). The RSIFR model initializes the model with RoBERTa-wwm-ext as a vector of text. Firstly, a Siamese structure with embedded soft alignment attention mechanism and BiLSTM is constructed to realize the information interaction between two sentences. Secondly, LSTM-BiLSTM network structure is constructed to enhance the expression of semantic logic before and after sentences. Then, build a training model with fine-tuning mechanism. Fine tune the text’s eigenvector parameters through label supervision. Finally, the fusion vectors of the sentence pairs are inserted into the MLP network layer, resulting in semantic matching results. RSIFR model starts from a variety of dimensions, strengthens the expression ability of vectors to text semantic relations, deeply mines the semantic similarities and differences between different sentences, and generally improves the Chinese semantic matching performance. Experiments on the public dataset LCQMC show that our model outperforms existing Chinese semantic matching models.
- Open Access
- 17 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 347-354
Semantic Maximum Relevance and Modal Alignment for Cross-Modal Retrieval
- 17 November 2022
- Published by Association for Computing Machinery (ACM)
- p. 347-354
Open AccessSemantic Maximum Relevance and Modal Alignment for Cross-Modal Retrieval