Wenling Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenling Wang has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Jiangtao Qi
School of Information Science and Electrical Engineering, Shandong Jiaotong University, Jinan, China
2 shared publications - Peiyu Liu
Shandong Normal University
2 shared publications - Songlin Jiao
Shandong Jiao Tong University, China
2 shared publications - Fuyong Xu
School of Information Science and Engineering, Shandong Normal University, Jinan, China
1 shared publication - Guangyuan Zhang
School of Information Science and Electrical Engineering, Shandong Jiaotong University, Jinan 250357, China
1 shared publication - Hongli Pei
Shandong Jiaotong University, School of Information Science and Electrical Engineering, Jinan, China
1 shared publication
Latest Publications
- Open Access
- 8 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 23 (2) , 1-17
A Relation Embedding Assistance Networks for Multi-hop Question Answering
Multi-hop Knowledge Graph Question Answering aims at finding an entity to answer natural language questions from knowledge graphs. When humans perform multi-hop reasoning, people tend to focus on specific relations across different hops and confirm the next entity. Therefore, most algorithms choose the wrong specific relation, which makes the system deviate from the correct reasoning path. The specific relation at each hop plays an important role in multi-hop question answering. Existing work mainly relies on the question representation as relation information, which cannot accurately calculate the specific relation distribution. In this article, we propose an interpretable assistance framework that fully utilizes the relation embeddings to assist in calculating relation distributions at each hop. Moreover, we employ the fusion attention mechanism to ensure the integrity of relation information and hence to enrich the relation embeddings. The experimental results on three English datasets and one Chinese dataset demonstrate that our method significantly outperforms all baselines. The source code of REAN will be available at https://github.com/2399240664/REAN
- 8 February 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Asian and Low-Resource Language Information Processing
- Vol. 23 (2) , 1-17
Open AccessA Relation Embedding Assistance Networks for Multi-hop Question Answering
Multi-hop Knowledge Graph Question Answering aims at finding an entity to answer natural language questions from knowledge graphs. When humans perform multi-hop reasoning, people tend to focus on specific relations across different hops and confirm the next entity. Therefore, most algorithms choose the wrong specific relation, which makes the system deviate from the correct reasoning path. The specific relation at each hop plays an important role in multi-hop question answering. Existing work mainly relies on the question representation as relation information, which cannot accurately calculate the specific relation distribution. In this article, we propose an interpretable assistance framework that fully utilizes the relation embeddings to assist in calculating relation distributions at each hop. Moreover, we employ the fusion attention mechanism to ensure the integrity of relation information and hence to enrich the relation embeddings. The experimental results on three English datasets and one Chinese dataset demonstrate that our method significantly outperforms all baselines. The source code of REAN will be available at https://github.com/2399240664/REAN
- 25 July 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (7) , 8195-8208
An improving reasoning network for complex question answering over temporal knowledge graphs
- 25 July 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (7) , 8195-8208
An improving reasoning network for complex question answering over temporal knowledge graphs