arrow
Return

Structured Self-Supervised Pretraining for Commonsense Knowledge Graph Completion

delete2021-11-22
delete1
delete
OA
AI
J
Jiayuan Huang
Y
Yangkai Du
S
Shuting Tao
K
Kun Xu
P
Pengtao Xie *
DOI:10.1162/tacl_a_00426delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
To develop commonsense-grounded NLP applications, a comprehensive and accurate commonsense knowledge graph (CKG) is needed. It is time-consuming to manually construct CKGs andmany research efforts have been devoted to the automatic construction of CKGs. Previous approaches focus on generating concepts that have direct and obvious relationships with existing concepts and lack an capability to generate unobvious concepts. In this work, we aim to bridge this gap. We propose a general graph-to-paths pretraining framework that leverages high-order structures in CKGs to capture high-order relationships between concepts. We instantiate this general framework to four special cases: long path, path-to-path, router, and graph-node-path. Experiments on two datasets demonstrate the effectiveness of our methods. The code will be released via the public GitHub repository.

Journal

T
Transactions of the Association for Computational Linguistics
IF:
6.9
Papers:
486
Citations:
5.7K

Organization

University of California System cover
University of California System
Scholars:
37.5W
Papers: 33.7W
Citations: 6.6K
U
University of California San Diego
Scholars:
4.6W
Papers: 3.5W
Citations: 924
Z
zhejiang university
Scholars:
17.6W
Papers: 12.0W
Citations: 152
researcher View more organizations