Yong Guo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yong Guo has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Shanshan Li
National university of defense technology, Changsha, China
4 shared publications - Changjian Wang
National University of Defense Technology
2 shared publications - Kele Xu
National university of defense technology, Changsha, China
2 shared publications - Yanru Bai
Tianjin University
2 shared publications - Zekun Tao
National University of Defense Technology, Changsha, Hunan, China
2 shared publications - Chuang Wang
National University of Defence Technology
1 shared publication
Latest Publications
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 437-448
MetaCoder: Generating Code from Multiple Perspectives
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 437-448
Open AccessMetaCoder: Generating Code from Multiple Perspectives
- 21 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (5) , 3501-3512
Information Diffusion Prediction With Augmented Diffusion Dependency and Multigranularity Temporal Influence
Information diffusion prediction plays a pivotal role in the analysis of information propagation across social networks. Many existing methods rely on learning social homophily solely from users’ social connections as a single diffusion dependency to drive information diffusion. Moreover, these approaches often capture temporal influence from cascades within discrete time intervals, which might be inadequate in describing complex diffusion processes and can limit prediction performance. To overcome these limitations, we propose a novel approach with augmented diffusion dependency and multigranularity temporal influence (ADDMT) for information diffusion prediction. Our method strategically leverages the interactive regularity implicit in historical diffusion cascades. This information is integrated with social homophily through a cross-graph convolution network (GCN) to augment the diffusion dependency among users. Furthermore, we introduce multiple overlapping sliding windows to partition diffusion cascades. Adjacent cascade slices exhibit 50% overlap, enhancing semantic and structural coherence. In addition, we employ the combination of hypergraph convolution networks (HGCNs) and temporal convolution networks (TCNs) to capture multigranularity temporal influence within cascades. This design enables our model to further discern evolutionary trends and ephemeral fluctuations in users’ preferences across time intervals. The experimental results, obtained from comprehensive evaluations on four realistic datasets, demonstrate the superior performance of our proposed model. In particular, our model surpasses previous state-of-the-art diffusion prediction models, as evidenced by improved metrics such as Hits@K and MAP@K. These results underscore the effectiveness and robustness of ADDMT in predicting information diffusion in social networks.
- 21 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 12 (5) , 3501-3512
Information Diffusion Prediction With Augmented Diffusion Dependency and Multigranularity Temporal Influence
Information diffusion prediction plays a pivotal role in the analysis of information propagation across social networks. Many existing methods rely on learning social homophily solely from users’ social connections as a single diffusion dependency to drive information diffusion. Moreover, these approaches often capture temporal influence from cascades within discrete time intervals, which might be inadequate in describing complex diffusion processes and can limit prediction performance. To overcome these limitations, we propose a novel approach with augmented diffusion dependency and multigranularity temporal influence (ADDMT) for information diffusion prediction. Our method strategically leverages the interactive regularity implicit in historical diffusion cascades. This information is integrated with social homophily through a cross-graph convolution network (GCN) to augment the diffusion dependency among users. Furthermore, we introduce multiple overlapping sliding windows to partition diffusion cascades. Adjacent cascade slices exhibit 50% overlap, enhancing semantic and structural coherence. In addition, we employ the combination of hypergraph convolution networks (HGCNs) and temporal convolution networks (TCNs) to capture multigranularity temporal influence within cascades. This design enables our model to further discern evolutionary trends and ephemeral fluctuations in users’ preferences across time intervals. The experimental results, obtained from comprehensive evaluations on four realistic datasets, demonstrate the superior performance of our proposed model. In particular, our model surpasses previous state-of-the-art diffusion prediction models, as evidenced by improved metrics such as Hits@K and MAP@K. These results underscore the effectiveness and robustness of ADDMT in predicting information diffusion in social networks.
- Open Access
- 24 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 23 (10) , 1-21
SIAT: Document-level Event Extraction via Spatiality-Augmented Interaction Model with Adaptive Thresholding
Document-level event extraction endeavors to automatically extract structural events from a given document. Many existing approaches focus on modeling entity interactions and decoding these interactions into events, assigning each entity as an event argument. However, these approaches encounter two primary limitations: they exclusively capture semantic dependencies to model entity interactions, overlooking the indication of the spatial distribution features of entities; they decode interactions imprecisely with a hard binary-classification boundary, potentially failing to calibrate micro differences in interactions. To overcome these limitations, we introduce a novel approach termed the S patiality-augmented I nteraction Model with A daptive T hresholding (SIAT). Our method addresses the first limitation by calculating the relative position encoding of entities to represent spatial interaction features. These features are then integrated with multi-granularity semantic interactions, enhancing the modeling of entity interactions for each entity pair. Furthermore, we introduce an adaptive event decoding mechanism, which establishes a more flexible decision boundary for different entity interactions. Additionally, an adaptive loss function for threshold learning is designed to further refine the model. Experimental results demonstrate that our proposed method achieves competitive performance compared to state-of-the-art methods on two public event extraction datasets while maintaining considerable training efficiency.
- 24 October 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 23 (10) , 1-21
Open AccessSIAT: Document-level Event Extraction via Spatiality-Augmented Interaction Model with Adaptive Thresholding
Document-level event extraction endeavors to automatically extract structural events from a given document. Many existing approaches focus on modeling entity interactions and decoding these interactions into events, assigning each entity as an event argument. However, these approaches encounter two primary limitations: they exclusively capture semantic dependencies to model entity interactions, overlooking the indication of the spatial distribution features of entities; they decode interactions imprecisely with a hard binary-classification boundary, potentially failing to calibrate micro differences in interactions. To overcome these limitations, we introduce a novel approach termed the S patiality-augmented I nteraction Model with A daptive T hresholding (SIAT). Our method addresses the first limitation by calculating the relative position encoding of entities to represent spatial interaction features. These features are then integrated with multi-granularity semantic interactions, enhancing the modeling of entity interactions for each entity pair. Furthermore, we introduce an adaptive event decoding mechanism, which establishes a more flexible decision boundary for different entity interactions. Additionally, an adaptive loss function for threshold learning is designed to further refine the model. Experimental results demonstrate that our proposed method achieves competitive performance compared to state-of-the-art methods on two public event extraction datasets while maintaining considerable training efficiency.
- 6 September 2022
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 64 (11) , 3017-3042
MICAR: nonlinear association rule mining based on maximal information coefficient
- 6 September 2022
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 64 (11) , 3017-3042
MICAR: nonlinear association rule mining based on maximal information coefficient
- 24 August 2022
- Published by Springer Nature
- p. 342-358
TZ-IMA: Supporting Integrity Measurement for Applications with ARM TrustZone
- 24 August 2022
- Published by Springer Nature
- p. 342-358
TZ-IMA: Supporting Integrity Measurement for Applications with ARM TrustZone
- Open Access
- 6 October 2020
- Published by DEStech Publications in DEStech Transactions on Engineering and Technology Research
- No. mcaee
K-Partition Ensemble Multi-label Classifier for Insurance Purchase Prediction
Individual insurance purchase prediction can help effectively and accurately advertise to maximize sales. Most current insurance purchase prediction model only considers whether a customer will buy certain insurance. In this way, the prediction will be time-consuming with the rapid growth of the number of insurance products. In order to provide more effective and efficient marketing methods for insurance companies, this work proposes a K-Partition Ensemble Multi-Label classification model to predict the customer’s possible future insurance purchase. First, by transforming the insurance purchase prediction problem into a multi-label classification problem, the balance between features and labels of data division in the insurance purchasing dataset is explored. Second, a k-partition ensemble multi-label classification model is introduced, where each distinct label constitutes in the training set as a new category of a single-label classification task, and the random forest is used for multi-class classification. The empirical test is carried out using the Insurance Company Case data from CoIL Challenge 2000. We find prediction classifiers perform the best when the number of labels is around 20. Empirical evidence indicates that our model manages to improve substantially over other 3 classical multi-label classification algorithms with relatively little time, especially in domains with a large number of labels. The research results also provide a new idea and useful reference for the application in specific fields construction of data models based on the multi-label evaluation.
- 6 October 2020
- Published by DEStech Publications in DEStech Transactions on Engineering and Technology Research
- No. mcaee
Open AccessK-Partition Ensemble Multi-label Classifier for Insurance Purchase Prediction
Individual insurance purchase prediction can help effectively and accurately advertise to maximize sales. Most current insurance purchase prediction model only considers whether a customer will buy certain insurance. In this way, the prediction will be time-consuming with the rapid growth of the number of insurance products. In order to provide more effective and efficient marketing methods for insurance companies, this work proposes a K-Partition Ensemble Multi-Label classification model to predict the customer’s possible future insurance purchase. First, by transforming the insurance purchase prediction problem into a multi-label classification problem, the balance between features and labels of data division in the insurance purchasing dataset is explored. Second, a k-partition ensemble multi-label classification model is introduced, where each distinct label constitutes in the training set as a new category of a single-label classification task, and the random forest is used for multi-class classification. The empirical test is carried out using the Insurance Company Case data from CoIL Challenge 2000. We find prediction classifiers perform the best when the number of labels is around 20. Empirical evidence indicates that our model manages to improve substantially over other 3 classical multi-label classification algorithms with relatively little time, especially in domains with a large number of labels. The research results also provide a new idea and useful reference for the application in specific fields construction of data models based on the multi-label evaluation.
- Open Access
- 3 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 174200-174209
Deep Code-Comment Understanding and Assessment
Code comments are a key software component for program comprehension and software maintainability. High-quality code and comments are urgently needed by data-driven models widely used in tasks like code summarization. Many existing approaches for assessing the quality of comments are machine learning based classification algorithms or rely on heuristic rules. These approaches are difficult to capture the complicated features of text data and are often limited in accuracy, efficiency, and generalization ability. In this paper, we convert the quality assessment of code comments into a classification problem based on the multi-input neural network. We summarize the input, the code and comments, into vectors using the attention-based Bi-LSTM model and the weighted GloVe model, respectively, and concatenate the code vectors and the comment vectors as the input of the Multiple-Layer Perceptron classifier for the comment quality assessment. Experimental results show that our approach, in general, outperforms the previous technique, on both our labeled dataset and the public dataset, with the F1-score of 96.91% and 91.90%, respectively. Using the training set and the testing set from distinct sources, our approach can still achieve reasonable performance, which demonstrates its generalization ability.
- 3 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 174200-174209
Open AccessDeep Code-Comment Understanding and Assessment
Code comments are a key software component for program comprehension and software maintainability. High-quality code and comments are urgently needed by data-driven models widely used in tasks like code summarization. Many existing approaches for assessing the quality of comments are machine learning based classification algorithms or rely on heuristic rules. These approaches are difficult to capture the complicated features of text data and are often limited in accuracy, efficiency, and generalization ability. In this paper, we convert the quality assessment of code comments into a classification problem based on the multi-input neural network. We summarize the input, the code and comments, into vectors using the attention-based Bi-LSTM model and the weighted GloVe model, respectively, and concatenate the code vectors and the comment vectors as the input of the Multiple-Layer Perceptron classifier for the comment quality assessment. Experimental results show that our approach, in general, outperforms the previous technique, on both our labeled dataset and the public dataset, with the F1-score of 96.91% and 91.90%, respectively. Using the training set and the testing set from distinct sources, our approach can still achieve reasonable performance, which demonstrates its generalization ability.