Distant supervision for relation extraction using tree kernels

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper we define a simple Relation Extraction system based on SVMs using tree kernels and employing a weakly supervised approach, known as Distant Supervision (DS). Our method uses the simple one-versus-all strategy to handle overlapping relations, i.e., de- fined on the same pair of entities. The DS data is defined over the New York Times corpus by means of Freebase as an external knowledge base, which indicates the relations of some of the entities of the NYT text. Our experiments show that our simple approach performs well in this domain with respect to the current state of the art.

Original languageEnglish
Title of host publicationCEUR Workshop Proceedings
PublisherCEUR-WS
Volume1404
Publication statusPublished - 2015
Event6th Italian Information Retrieval Workshop, IIR 2015 - Cagliari, Italy
Duration: 25 May 201526 May 2015

Other

Other6th Italian Information Retrieval Workshop, IIR 2015
CountryItaly
CityCagliari
Period25/5/1526/5/15

Fingerprint

Experiments

Keywords

  • Distant Supervision
  • Relation Extraction
  • Support Vector Machines
  • Tree Kernels

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Abad, A., & Moschitti, A. (2015). Distant supervision for relation extraction using tree kernels. In CEUR Workshop Proceedings (Vol. 1404). CEUR-WS.

Distant supervision for relation extraction using tree kernels. / Abad, Azad; Moschitti, Alessandro.

CEUR Workshop Proceedings. Vol. 1404 CEUR-WS, 2015.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abad, A & Moschitti, A 2015, Distant supervision for relation extraction using tree kernels. in CEUR Workshop Proceedings. vol. 1404, CEUR-WS, 6th Italian Information Retrieval Workshop, IIR 2015, Cagliari, Italy, 25/5/15.
Abad A, Moschitti A. Distant supervision for relation extraction using tree kernels. In CEUR Workshop Proceedings. Vol. 1404. CEUR-WS. 2015
Abad, Azad ; Moschitti, Alessandro. / Distant supervision for relation extraction using tree kernels. CEUR Workshop Proceedings. Vol. 1404 CEUR-WS, 2015.
@inproceedings{7ea28dadf9924a978cd9e14dcc241d6f,
title = "Distant supervision for relation extraction using tree kernels",
abstract = "In this paper we define a simple Relation Extraction system based on SVMs using tree kernels and employing a weakly supervised approach, known as Distant Supervision (DS). Our method uses the simple one-versus-all strategy to handle overlapping relations, i.e., de- fined on the same pair of entities. The DS data is defined over the New York Times corpus by means of Freebase as an external knowledge base, which indicates the relations of some of the entities of the NYT text. Our experiments show that our simple approach performs well in this domain with respect to the current state of the art.",
keywords = "Distant Supervision, Relation Extraction, Support Vector Machines, Tree Kernels",
author = "Azad Abad and Alessandro Moschitti",
year = "2015",
language = "English",
volume = "1404",
booktitle = "CEUR Workshop Proceedings",
publisher = "CEUR-WS",

}

TY - GEN

T1 - Distant supervision for relation extraction using tree kernels

AU - Abad, Azad

AU - Moschitti, Alessandro

PY - 2015

Y1 - 2015

N2 - In this paper we define a simple Relation Extraction system based on SVMs using tree kernels and employing a weakly supervised approach, known as Distant Supervision (DS). Our method uses the simple one-versus-all strategy to handle overlapping relations, i.e., de- fined on the same pair of entities. The DS data is defined over the New York Times corpus by means of Freebase as an external knowledge base, which indicates the relations of some of the entities of the NYT text. Our experiments show that our simple approach performs well in this domain with respect to the current state of the art.

AB - In this paper we define a simple Relation Extraction system based on SVMs using tree kernels and employing a weakly supervised approach, known as Distant Supervision (DS). Our method uses the simple one-versus-all strategy to handle overlapping relations, i.e., de- fined on the same pair of entities. The DS data is defined over the New York Times corpus by means of Freebase as an external knowledge base, which indicates the relations of some of the entities of the NYT text. Our experiments show that our simple approach performs well in this domain with respect to the current state of the art.

KW - Distant Supervision

KW - Relation Extraction

KW - Support Vector Machines

KW - Tree Kernels

UR - http://www.scopus.com/inward/record.url?scp=84938521333&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938521333&partnerID=8YFLogxK

M3 - Conference contribution

VL - 1404

BT - CEUR Workshop Proceedings

PB - CEUR-WS

ER -