LinkNBed: Multi-Graph Representation Learning with Entity Linkage (P18-1)

Copied to clipboard

Challenge: Knowledge graphs have emerged as an important model for studying complex multi-relational data.
Approach: They propose a deep relational learning framework that learns entity and relationship representations across multiple graphs.
Outcome: The proposed framework improves on the state-of-the-art relational learning approaches and identifies entity linkage across graphs.

Similar Papers

Jointly Learning Entity and Relation Representations for Entity Alignment (D19-1)

Copied to clipboard

Challenge: Entity alignment is a viable method for integrating heterogeneous knowledge among different knowledge graphs (KGs).
Approach: They propose a Graph Convolutional Network-based framework for learning relation representations by embedding relation seeds into entities and incorporating relation approximation into entities to iteratively improve alignment.
Outcome: The proposed approach outperforms state-of-the-art methods on three real-world cross-lingual datasets.
Joint Type Inference on Entities and Relations via Graph Convolutional Networks (P19-1)

Copied to clipboard

Challenge: a novel graph convolutional network (GCN) is proposed for the task of joint entity relation extraction.
Approach: They propose a graph convolutional network running on an entity-relation bipartite graph . they propose combining two different methods to perform joint entity relation extraction .
Outcome: The proposed model outperforms existing joint models in entity performance and is competitive with the state-of-the-art in relation performance.
A2N: Attending to Neighbors for Knowledge Graph Inference (P19-1)

Copied to clipboard

Challenge: Existing knowledge graph completion methods learn a fixed embedding for every entity, which is suboptimal as it requires memorizing and generalizing to all possible entity relationships.
Approach: They propose a method which learns query-dependent representations of entities by combining relevant neighborhood of an entity.
Outcome: The proposed model performs competitively or better than existing state-of-the-art models for knowledge graph completion.
Distant Learning for Entity Linking with Automatic Noise Detection (P19-1)

Copied to clipboard

Challenge: Accurate entity linkers have been produced for domains and languages where no or very limited amounts of labeled data are available.
Approach: They propose to use annotated text to learn to link entities without labeling . they frame the task as a multi-instance learning problem and rely on surface matching to create initial noisy labels.
Outcome: The proposed method outperforms the baseline surface matching model for a subset of entities.
Accurate Text-Enhanced Knowledge Graph Representation Learning (N18-1)

Copied to clipboard

Challenge: Existing representation learning methods for knowledge graph representation do not consider the ambiguity of relations and entities.
Approach: They propose a text-enhanced knowledge graph representation learning method which exploits the entity descriptions and triple-specific relation mention to enhance representations.
Outcome: The proposed method outperforms existing representation learning models on link prediction and triple classification tasks and significantly outperformed existing models.
Improving Neural Entity Disambiguation with Graph Embeddings (P19-2)

Copied to clipboard

Challenge: Entity Disambiguation (ED) is the task of linking an ambiguous entity mention to a corresponding entry in a knowledge base.
Approach: They propose a method that integrates structured information from the knowledge base with unstructured information from text-based representations.
Outcome: The proposed method improves on a graph of hyperlinks between Wikipedia articles and a state-of-the-art neural ED model.
A Novel Table-to-Graph Generation Approach for Document-Level Joint Entity and Relation Extraction (2023.acl-long)

Copied to clipboard

Challenge: Existing document-level relation extraction methods assume entities and their mentions are given beforehand, which is inadequate for real-world applications.
Approach: They propose a table-to-graph generation model for joint extraction of entities and relations at document-level.
Outcome: The proposed model surpasses existing methods by a large margin and achieves state-of-the-art results on a document-level relation extraction dataset.
Knowledge Router: Learning Disentangled Representations for Knowledge Graphs (2021.naacl-main)

Copied to clipboard

Challenge: Existing approaches to learning from relational patterns and structural information ignore the intrinsic complexity of KGs.
Approach: They propose to learn latent properties of KG entities by using a neighborhood mechanism to disentangle the inner properties of each entity.
Outcome: The proposed method significantly improves performance on key metrics on several benchmark datasets.
Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs (P19-1)

Copied to clipboard

Challenge: Existing knowledge graphs (KGs) are incomplete or partial information, in the form of missing relations between entities, which gives rise to the task of knowledge base completion (also known as relation prediction).
Approach: They propose to capture both entity and relation features in any given neighborhood and encapsulate relation clusters and multi-hop relations in their attention-based model.
Outcome: The proposed model captures both entity and relation features in any given neighborhood and also encapsulates relation clusters and multi-hop relations.
Joint Learning of Representations for Web-tables, Entities and Types using Graph Convolutional Network (2021.eacl-main)

Copied to clipboard

Challenge: Existing approaches for table annotation with entities and types capture the syntactic structure of tables using graphical models or learn embeddings of table entries without accounting for the complete syntaktic structure.
Approach: They propose a Graph Convolutional Network that captures the complete structure of tables, knowledge graph and the training annotations and jointly learns embeddings for table elements as well as the entities and types.
Outcome: The proposed model significantly outperforms state-of-the-art methods on 5 benchmark datasets while showing promising performance on downstream table-related applications.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations