Relational Learning To Capture The Dynamics And Sparsity Of Knowledge Graphs

THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE(2021)

引用 1|浏览10
暂无评分
摘要
The rapid growth of large scale event datasets with timestamps has given rise to the dynamically evolving multi-relational knowledge graphs. Temporal reasoning over such data brings on many challenges and is still not well understood. Most real-world knowledge graphs are characterized by a long-tail relation frequency distribution where a significant fraction of relations occurs only a handful of times. This observation has given rise to the recent interest in low-shot learning methods that are able to generalize from only a few examples. The existing approaches, however, are tailored to static knowledge graphs and not easily generalized to temporal settings, where data scarcity poses even bigger problems, due to the occurrence of new, previously unseen relations. The goal of my doctoral research is to introduce new approaches for learning meaningful representation that capture the dynamics of temporal knowledge graphs while tackling various existing challenges such as data scarcity.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要