Medical question summarization is an important but difficult task, where the input is often complex and erroneous while annotated data is expensive to acquire.
1 code implementation • 30 Sep 2022 • Shumin Deng, Chengming Wang, Zhoubo Li, Ningyu Zhang, Zelin Dai, Hehong Chen, Feiyu Xiong, Ming Yan, Qiang Chen, Mosha Chen, Jiaoyan Chen, Jeff Z. Pan, Bryan Hooi, Huajun Chen
We release all the open resources (OpenBG benchmarks) derived from it for the community and report experimental results of KG-centric tasks.
Knowledge graph completion aims to address the problem of extending a KG with missing triples.
Ranked #43 on Link Prediction on FB15k-237
Previous works leverage logical forms to facilitate logical knowledge-conditioned text generation.
1 code implementation • • Ningyu Zhang, Mosha Chen, Zhen Bi, Xiaozhuan Liang, Lei LI, Xin Shang, Kangping Yin, Chuanqi Tan, Jian Xu, Fei Huang, Luo Si, Yuan Ni, Guotong Xie, Zhifang Sui, Baobao Chang, Hui Zong, Zheng Yuan, Linfeng Li, Jun Yan, Hongying Zan, Kunli Zhang, Buzhou Tang, Qingcai Chen
Artificial Intelligence (AI), along with the recent progress in biomedical language understanding, is gradually changing medical practice.
Ranked #1 on Medical Relation Extraction on CMeIE
Specifically, we leverage an encoder module to capture the context information of entities and a U-shaped segmentation module over the image-style feature map to capture global interdependency among triples.
Ranked #3 on Relation Extraction on ReDocRED
In order to accelerate the research for domain-specific knowledge graphs in the medical domain, we introduce DiaKG, a high-quality Chinese dataset for Diabetes knowledge graph, which contains 22, 050 entities and 6, 890 relations in total.
Most of current methods to ED rely heavily on training instances, and almost ignore the correlation of event types.
We introduce a Poincare probe, a structural probe projecting these embeddings into a Poincare subspace with explicitly defined hierarchies.
Recent neural-based relation extraction approaches, though achieving promising improvement on benchmark datasets, have reported their vulnerability towards adversarial attacks.
Automatic Question Answering (QA) has been successfully applied in various domains such as search engines and chatbots.
With the TreeCRF we achieve a uniform way to jointly model the observed and the latent nodes.
Ranked #11 on Nested Named Entity Recognition on ACE 2005
In the CTRP framework, a model takes a PICO-formatted clinical trial proposal with its background as input and predicts the result, i. e. how the Intervention group compares with the Comparison group in terms of the measured Outcome in the studied Population.
We introduce a prototype model and provide an open-source and extensible toolkit called OpenUE for various extraction tasks.
In this paper, we revisit the end-to-end triple extraction task for sequence generation.
Ranked #8 on Relation Extraction on WebNLG
Hypernym discovery aims to discover the hypernym word sets given a hyponym word and proper corpus.
Ranked #3 on Hypernym Discovery on General