Sciweavers

18 search results - page 2 / 4
» Semi-Supervised Convolution Graph Kernels for Relation Extra...
Sort
View
EMNLP
2009
13 years 2 months ago
Convolution Kernels on Constituent, Dependency and Sequential Structures for Relation Extraction
This paper explores the use of innovative kernels based on syntactic and semantic structures for a target relation extraction task. Syntax is derived from constituent and dependen...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
ACL
2010
13 years 2 months ago
Convolution Kernel over Packed Parse Forest
This paper proposes a convolution forest kernel to effectively explore rich structured features embedded in a packed parse forest. As opposed to the convolution tree kernel, the p...
Min Zhang, Hui Zhang, Haizhou Li
IPM
2008
159views more  IPM 2008»
13 years 4 months ago
Exploring syntactic structured features over parse trees for relation extraction using kernel methods
Extracting semantic relationships between entities from text documents is challenging in information extraction and important for deep information processing and management. This ...
Min Zhang, Guodong Zhou, AiTi Aw
ACL
2006
13 years 6 months ago
A Composite Kernel to Extract Relations between Entities with Both Flat and Structured Features
This paper proposes a novel composite kernel for relation extraction. The composite kernel consists of two individual kernels: an entity kernel that allows for entity-related feat...
Min Zhang, Jie Zhang, Jian Su, Guodong Zhou
ICPR
2006
IEEE
14 years 5 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus