Fusing topology contexts and logical rules in language models for knowledge graph completion
Knowledge graph completion (KGC) aims to infer missing facts based on the observed ones, which is significant for many downstream applications. Given the success of deep learning and pre-trained language models (LMs), some LM-based methods are proposed for the KGC task. However, most of them focus o...
Saved in:
Main Authors: | Lin, Qika, Mao, Rui, Liu, Jun, Xu, Fangzhi, Cambria, Erik |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/170544 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graph
by: David, Monica Carlita G., et al.
Published: (2018) -
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graphs
by: David, Monica Carlita G., et al.
Published: (2018) -
Resistance distance in complete n-partite graphs
by: Gervacio, Severino V.
Published: (2016) -
On Completely k-Magic Regular Graphs
by: Eniego, Arnold A, et al.
Published: (2015) -
Fusing pairwise modalities for emotion recognition in conversations
by: Fan, Chunxiao, et al.
Published: (2024)