Sciweavers

1326 search results - page 11 / 266
» Approximate Tree Kernels
Sort
View
ACL
2004
13 years 10 months ago
Convolution Kernels with Feature Selection for Natural Language Processing Tasks
Convolution kernels, such as sequence and tree kernels, are advantageous for both the concept and accuracy of many natural language processing (NLP) tasks. Experiments have, howev...
Jun Suzuki, Hideki Isozaki, Eisaku Maeda
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 1 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
ICDM
2006
IEEE
225views Data Mining» more  ICDM 2006»
14 years 2 months ago
Adaptive Kernel Principal Component Analysis with Unsupervised Learning of Kernels
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
Daoqiang Zhang, Zhi-Hua Zhou, Songcan Chen
DSMML
2004
Springer
14 years 1 months ago
Understanding Gaussian Process Regression Using the Equivalent Kernel
The equivalent kernel [1] is a way of understanding how Gaussian process regression works for large sample sizes based on a continuum limit. In this paper we show how to approximat...
Peter Sollich, Christopher K. I. Williams
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
14 years 3 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...