1326 search results - page 7 / 266 » Approximate Tree Kernels |
DAGM
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
AAAI
2011
12 years 7 months ago
2011
We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capabili...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Maji and Berg [13] have recently introduced an explicit feature map approximating the intersection kernel. This enables efficient learning methods for linear kernels to be applied...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
The sequence kernel has been shown to be a promising kernel function for learning from sequential data such as speech and DNA. However, it is not scalable to massive datasets due ...
NIPS
2007
13 years 8 months ago
2007
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...