Pith. sign in

REVIEW 3 cited by

Long-tail Relation Extraction via Knowledge Graph Embeddings and Graph Convolution Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.01306 v1 pith:LWNPVT6H submitted 2019-03-04 cs.IR cs.AIcs.CLcs.DBcs.LG

classification cs.IRcs.AIcs.CLcs.DBcs.LG
keywords knowledgeclassesgraphextractionrelationrelationaltailapproach
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a distance supervised relation extraction approach for long-tailed, imbalanced data which is prevalent in real-world settings. Here, the challenge is to learn accurate "few-shot" models for classes existing at the tail of the class distribution, for which little data is available. Inspired by the rich semantic correlations between classes at the long tail and those at the head, we take advantage of the knowledge from data-rich classes at the head of the distribution to boost the performance of the data-poor classes at the tail. First, we propose to leverage implicit relational knowledge among class labels from knowledge graph embeddings and learn explicit relational knowledge using graph convolution networks. Second, we integrate that relational knowledge into relation extraction model by coarse-to-fine knowledge-aware attention mechanism. We demonstrate our results for a large-scale benchmark dataset which show that our approach significantly outperforms other baselines, especially for long-tail relations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. KLIPA: A Knowledge Graph and LLM-Driven QA Framework for IP Analysis

    cs.IR 2025-09 conditional novelty 4.0 of 10

    KLIPA integrates a Neo4j knowledge graph, RAG, and a ReAct agent for patent QA, and shows VQA-based graph construction beats OCR+LLM on extraction metrics.

  2. Context-aware Deep Model for Entity Recommendation in Search Engine at Alibaba

    cs.IR 2019-09 conditional novelty 4.0 of 10

    A BiLSTM-plus-attention model learns query and entity embeddings jointly from search logs and recommends entities for arbitrary Chinese search queries without requiring an explicit entity in the query.

  3. Transfer Learning for Relation Extraction via Relation-Gated Adversarial Learning

    cs.LG 2019-08 conditional novelty 4.0 of 10

    A relation-gate that balances category-level and instance-level weights reduces negative transfer in partial domain adaptation for relation extraction.

Pith tools