Shi Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Shi Li has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Guoliang Zhao
Northeast Forestry University
1 shared publication - Jifeng Guo
College of Computer Science and Engineering, Guilin University of Aerospace Technology, Guilin, China
1 shared publication Meng Xu
Northeast Forestry University
1 shared publication- Wenbo Sun
College of Information and Computer Engineering, Northeast Forestry University, Harbin, China
1 shared publication - Wenfeng Cheng
School of Information and Computer Engineering, Northeast Forestry University, Harbin, China
1 shared publication - Wenqian Zhang
School of Information and Computer Engineering, Northeast Forestry University, Harbin, China
1 shared publication
Latest Publications
- 30 January 2026
- Published by Springer Nature
- p. 435-449
DP-SAAM: Dynamic Proxy Nodes and Structure-Aware Adaptive Matching for Document-Level Event Extraction
- 30 January 2026
- Published by Springer Nature
- p. 435-449
DP-SAAM: Dynamic Proxy Nodes and Structure-Aware Adaptive Matching for Document-Level Event Extraction
- Open Access
- 4 January 2026
- Published by MDPI AG in Information
- Vol. 17 (1) , 42
Knowledge Enhancement and Semantic Information-Fused Emotion–Cause Pair Extraction
Emotion–cause pair extraction is a crucial task in natural language processing that identifies emotional expressions and their corresponding causes within text. Despite substantial progress, most current approaches depend on sequence modeling or standard attention mechanisms, which frequently overlook intricate inter-sentential relationships and fail to utilize causal commonsense knowledge to enhance semantic links between clauses. To address these limitations, this paper introduces KESIF, a novel emotion–cause pair extraction model that integrates knowledge enhancement with enriched semantic information for improved performance. The proposed model incorporates a graph attention network to capture semantic dependency relationships between sentences, integrates causal commonsense knowledge from the ATOMIC knowledge base to enrich semantic representations, and utilizes a bidirectional MRC mechanism for achieving effective bidirectional matching between emotions and causes. The model’s performance is assessed using core metrics, such as precision, recall, and F1 score. Experimental results on both Chinese and English datasets demonstrate that our method outperforms SOTA baselines.
- 4 January 2026
- Published by MDPI AG in Information
- Vol. 17 (1) , 42
Open AccessKnowledge Enhancement and Semantic Information-Fused Emotion–Cause Pair Extraction
Emotion–cause pair extraction is a crucial task in natural language processing that identifies emotional expressions and their corresponding causes within text. Despite substantial progress, most current approaches depend on sequence modeling or standard attention mechanisms, which frequently overlook intricate inter-sentential relationships and fail to utilize causal commonsense knowledge to enhance semantic links between clauses. To address these limitations, this paper introduces KESIF, a novel emotion–cause pair extraction model that integrates knowledge enhancement with enriched semantic information for improved performance. The proposed model incorporates a graph attention network to capture semantic dependency relationships between sentences, integrates causal commonsense knowledge from the ATOMIC knowledge base to enrich semantic representations, and utilizes a bidirectional MRC mechanism for achieving effective bidirectional matching between emotions and causes. The model’s performance is assessed using core metrics, such as precision, recall, and F1 score. Experimental results on both Chinese and English datasets demonstrate that our method outperforms SOTA baselines.
- 13 March 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (16) , 10197-10214
Using join learning of multi-level features for automated essay scoring
- 13 March 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (16) , 10197-10214
Using join learning of multi-level features for automated essay scoring
- Open Access
- 1 November 2023
- Published by MDPI AG in Information
- Vol. 14 (11) , 593
Multiple Information-Aware Recurrent Reasoning Network for Joint Dialogue Act Recognition and Sentiment Classification
The task of joint dialogue act recognition (DAR) and sentiment classification (DSC) aims to predict both the act and sentiment labels of each utterance in a dialogue. Existing methods mainly focus on local or global semantic features of the dialogue from a single perspective, disregarding the impact of the other part. Therefore, we propose a multiple information-aware recurrent reasoning network (MIRER). Firstly, the sequence information is smoothly sent to multiple local information layers for fine-grained feature extraction through a BiLSTM-connected hybrid CNN group method. Secondly, to obtain global semantic features that are speaker-, context-, and temporal-sensitive, we design a speaker-aware temporal reasoning heterogeneous graph to characterize interactions between utterances spoken by different speakers, incorporating different types of nodes and meta-relations with node-edge-type-dependent parameters. We also design a dual-task temporal reasoning heterogeneous graph to realize the semantic-level and prediction-level self-interaction and interaction, and we constantly revise and improve the label in the process of dual-task recurrent reasoning. MIRER fully integrates context-level features, fine-grained features, and global semantic features, including speaker, context, and temporal sensitivity, to better simulate conversation scenarios. We validated the method on two public dialogue datasets, Mastodon and DailyDialog, and the experimental results show that MIRER outperforms various existing baseline models.
- 1 November 2023
- Published by MDPI AG in Information
- Vol. 14 (11) , 593
Open AccessMultiple Information-Aware Recurrent Reasoning Network for Joint Dialogue Act Recognition and Sentiment Classification
The task of joint dialogue act recognition (DAR) and sentiment classification (DSC) aims to predict both the act and sentiment labels of each utterance in a dialogue. Existing methods mainly focus on local or global semantic features of the dialogue from a single perspective, disregarding the impact of the other part. Therefore, we propose a multiple information-aware recurrent reasoning network (MIRER). Firstly, the sequence information is smoothly sent to multiple local information layers for fine-grained feature extraction through a BiLSTM-connected hybrid CNN group method. Secondly, to obtain global semantic features that are speaker-, context-, and temporal-sensitive, we design a speaker-aware temporal reasoning heterogeneous graph to characterize interactions between utterances spoken by different speakers, incorporating different types of nodes and meta-relations with node-edge-type-dependent parameters. We also design a dual-task temporal reasoning heterogeneous graph to realize the semantic-level and prediction-level self-interaction and interaction, and we constantly revise and improve the label in the process of dual-task recurrent reasoning. MIRER fully integrates context-level features, fine-grained features, and global semantic features, including speaker, context, and temporal sensitivity, to better simulate conversation scenarios. We validated the method on two public dialogue datasets, Mastodon and DailyDialog, and the experimental results show that MIRER outperforms various existing baseline models.
- 27 January 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (15) , 18420-18430
RRQA: reconfirmed reader for open-domain question answering
- 27 January 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (15) , 18420-18430
RRQA: reconfirmed reader for open-domain question answering
- 30 June 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (21) , 19079-19090
Augmenting the global semantic information between words to heterogeneous graph for deception detection
- 30 June 2022
- Published by Springer Nature in Neural Computing and Applications
- Vol. 34 (21) , 19079-19090
Augmenting the global semantic information between words to heterogeneous graph for deception detection
- 11 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 28 (10709908) , 2142-2146
Biclustering Collaborative Learning for Cross-Domain Person Re-Identification
In the cross-domain person re-identification (ReID) method based on clustering, the performance of the model depends heavily on the quality of the information it obtains from clustering. To improve the reliability of the clustering information obtained by the model, we propose a biclustering collaborative learning (BCL) framework derived from an identity disentanglement adaptation network (IDA-Net). IDA-Net encodes the identity and style of the input image and transfers the style on the premise of maintaining identity consistency. By comparing the clustering results obtained on the same dataset before and after the transfer process, BCL can select hard samples with higher confidence for model optimization. In each iteration, we design a conditional batch hard triplet loss to optimize the two networks. Extensive experiments on large-scale datasets (Maket1501, DukeMTMC-reID and MSMT17) demonstrate the superior performance of BCL over the state-of-the-art methods.
- 11 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 28 (10709908) , 2142-2146
Biclustering Collaborative Learning for Cross-Domain Person Re-Identification
In the cross-domain person re-identification (ReID) method based on clustering, the performance of the model depends heavily on the quality of the information it obtains from clustering. To improve the reliability of the clustering information obtained by the model, we propose a biclustering collaborative learning (BCL) framework derived from an identity disentanglement adaptation network (IDA-Net). IDA-Net encodes the identity and style of the input image and transfers the style on the premise of maintaining identity consistency. By comparing the clustering results obtained on the same dataset before and after the transfer process, BCL can select hard samples with higher confidence for model optimization. In each iteration, we design a conditional batch hard triplet loss to optimize the two networks. Extensive experiments on large-scale datasets (Maket1501, DukeMTMC-reID and MSMT17) demonstrate the superior performance of BCL over the state-of-the-art methods.