Relation Extraction with Matrix Factorization and Universal Schemas

UCL Australia · University of Massachusetts Amherst

Abstract

Traditional relation extraction predicts relations within some fixed and finite target schema. Machine learning approaches to this task require either manual annotation or, in the case of distant supervision, existing structured sources of the same schema. The need for existing datasets can be avoided by using a universal schema: the union of all involved schemas (surface form predicates as in OpenIE, and relations in the schemas of pre-existing databases). This schema has an almost unlimited set of relations (due to surface forms), and supports integration with existing structured data (through the relation types of existing databases). To populate a database of such schema we present matrix factorization…

Citation impact

588
total citations
FWCI
93.90
Percentile
100%
References
31
Citations per year

Authors

4

Topics & keywords

Keywords
  • Computer science
  • Schema (genetic algorithms)
  • Tuple
  • Relationship extraction
  • Conceptual schema
  • Matrix decomposition
  • Annotation
  • Artificial intelligence
UN Sustainable Development Goals
  • Quality Education
No related works found for this paper.

Funding