Fast and large-scale unsupervised relation extraction

Sho Takase, Naoaki Okazaki, Kentaro Inui

Research output: Contribution to conferencePaperpeer-review

4 Citations (Scopus)

Abstract

A common approach to unsupervised relation extraction builds clusters of patterns expressing the same relation. In order to obtain clusters of relational patterns of good quality, we have two major challenges: the semantic representation of relational patterns and the scalability to large data. In this paper, we explore various methods for modeling the meaning of a pattern and for computing the similarty of patterns mined from huge data. In order to achieve this goal, we apply algorithms for approximate frequency counting and efficient dimension reduction to unsupervised relation extraction. The experimental results show that approximate frequency counting and dimension reduction not only speeds up similarity computation but also improves the quality of pattern vectors.

Original languageEnglish
Pages96-105
Number of pages10
Publication statusPublished - 2015
Event29th Pacific Asia Conference on Language, Information and Computation, PACLIC 2015 - Shanghai, China
Duration: 2015 Oct 302015 Nov 1

Other

Other29th Pacific Asia Conference on Language, Information and Computation, PACLIC 2015
Country/TerritoryChina
CityShanghai
Period15/10/3015/11/1

ASJC Scopus subject areas

  • Artificial Intelligence
  • Human-Computer Interaction
  • Linguistics and Language

Fingerprint

Dive into the research topics of 'Fast and large-scale unsupervised relation extraction'. Together they form a unique fingerprint.

Cite this