Sciweavers

1326 search results - page 62 / 266
» Approximate Tree Kernels
Sort
View
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 1 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
CVPR
2010
IEEE
14 years 4 months ago
Locally-Parametric Pictorial Structures
Pictorial structure (PS) models are extensively used for part-based recognition of scenes, people, animals and multi-part objects. To achieve tractability, the structure and param...
Benjamin Sapp, Chris Jordan, Ben Taskar
COLING
2010
13 years 3 months ago
Kernel-based Reranking for Named-Entity Extraction
We present novel kernels based on structured and unstructured features for reranking the N-best hypotheses of conditional random fields (CRFs) applied to entity extraction. The fo...
Truc-Vien T. Nguyen, Alessandro Moschitti, Giusepp...
IJCNN
2007
IEEE
14 years 3 months ago
Agnostic Learning versus Prior Knowledge in the Design of Kernel Machines
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
Gavin C. Cawley, Nicola L. C. Talbot
CSDA
2007
128views more  CSDA 2007»
13 years 8 months ago
Regularized linear and kernel redundancy analysis
Redundancy analysis (RA) is a versatile technique used to predict multivariate criterion variables from multivariate predictor variables. The reduced-rank feature of RA captures r...
Yoshio Takane, Heungsun Hwang