Jiangtao Qi

Jiangtao Qi

Auto-generated profile, based on publicly available information

Jiangtao Qi

School of Information Science and Electrical Engineering, Shandong Jiao Tong University, Jinan 250104, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 January 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
YSYanhan Sun
Yanhan Sun
ZZZhenfang Zhu
Zhenfang Zhu
ZZZuo Zicheng
Zuo Zicheng
KLKefeng Li
Kefeng Li
SGShuai Gong
Shuai Gong
JQJiangtao Qi
Jiangtao Qi

6 August 2023 in Electronics
Verified
Journal Article
Open access
PDF file
ZZZuo Zicheng
Zuo Zicheng
ZZZhenfang Zhu
Zhenfang Zhu
WWWenqing Wu
Wenqing Wu
WWWenling Wang
Wenling Wang
JQJiangtao Qi
Jiangtao Qi
LZLinghui Zhong
Linghui Zhong
The objective of knowledge graph question answering is to assist users in answering questions by utilizing the information stored within the graph. Users are not required to comprehend the underlying data structure. This is a difficult task because, on the one hand, correctly understanding the semantics of a problem is difficult for machines. On the other hand, the growing knowledge graph will inevitably lead to information retrieval errors. Specifically, the question-answering task has three difficulties: word abbreviation, object complement, and entity ambiguity. An object complement means that different entities share the same predicate, and entity ambiguity means that words have different meanings in different contexts. To solve these problems, we propose a novel method named the Chunked Learning Network. It uses different models according to different scenarios to obtain a vector representation of the topic entity and relation in the question. The answer entity representation that yields the closest fact triplet, according to a joint distance metric, is returned as the answer. For sentences with an object complement, we use dependency parsing to construct dependency relationships between words to obtain more accurate vector representations. Experiments demonstrate the effectiveness of our method.