Sciweavers

35 search results - page 1 / 7
» Reverse Engineering of Tree Kernel Feature Spaces
Sort
View
EMNLP
2009
13 years 2 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti
ACL
2006
13 years 5 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
JMLR
2010
155views more  JMLR 2010»
13 years 2 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
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
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