Sciweavers

1326 search results - page 9 / 266
» Approximate Tree Kernels
Sort
View
NIPS
2001
13 years 10 months ago
Sampling Techniques for Kernel Methods
We propose randomized techniques for speeding up Kernel Principal Component Analysis on three levels: sampling and quantization of the Gram matrix in training, randomized rounding...
Dimitris Achlioptas, Frank McSherry, Bernhard Sch&...
CIAC
2006
Springer
110views Algorithms» more  CIAC 2006»
14 years 9 days ago
Distance Approximating Trees: Complexity and Algorithms
Let 1 and 0 be real numbers. A tree T = (V, E ) is a distance (, )
Feodor F. Dragan, Chenyu Yan
PAMI
2007
131views more  PAMI 2007»
13 years 8 months ago
The Gray-Code Filter Kernels
—In this paper, we introduce a family of filter kernels—the Gray-Code Kernels (GCK) and demonstrate their use in image analysis. Filtering an image with a sequence of Gray-Code...
Gil Ben-Artzi, Hagit Hel-Or, Yacov Hel-Or
COLT
2010
Springer
13 years 6 months ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
COLING
2008
13 years 10 months ago
Exploiting Constituent Dependencies for Tree Kernel-Based Semantic Relation Extraction
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the node...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...