Lune

EMNLP2022顶会

DEER: Descriptive Knowledge Graph for Explaining Entity Relationships

Jie Huang, Kerui Zhu, Kevin Chen-Chuan Chang, Jinjun Xiong, Wen-Mei Hwu

2022年份
8被引次数
1顶会引用

摘要

We propose DEER (Descriptive Knowledge Graph for Explaining Entity Relationships)an open and informative form of modeling entity relationships. In DEER, relationships between entities are represented by free-text relation descriptions. For instance, the relationship between entities of machine learning and algorithm can be represented as "Machine learning explores the study and construction of algorithms that can learn from and make predictions on data." To construct DEER, we propose a self-supervised learning method to extract relation descriptions with the analysis of dependency patterns and generate relation descriptions with a transformer-based relation description synthesizing model, where no human labeling is required. Experiments demonstrate that our system can extract and generate highquality relation descriptions for explaining entity relationships. The results suggest that we can build an open and informative knowledge graph without human annotation. 1 Artificial Intelligence Computer Science Deep Learning Machine Learning Algorithm As of 2020, deep learning has become the dominant approach for much ongoing work in the field of machine learning. Machine learning explores the study and construction of algorithms that can learn from and make predictions on data. Machine learning is a subfield of soft computing within computer science that evolved from the study of pattern recognition and computational learning theory in artificial intelligence. As a scientific endeavor, machine learning grew out of the quest for artificial intelligence. Regularization Regularization, in the context of machine learning, refers to the process of modifying a learning algorithm so as to prevent overfitting.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

引用它的顶会 Paper1

问问它们各自怎么用它

它引用的顶会 Paper5

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖