Sciweavers

1864 search results - page 299 / 373
» Question classification using support vector machines
Sort
View
138
Voted
ACL
2006
15 years 4 months ago
Discriminative Classifiers for Deterministic Dependency Parsing
Deterministic parsing guided by treebankinduced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systemat...
Johan Hall, Joakim Nivre, Jens Nilsson
NIPS
2000
15 years 4 months ago
The Kernel Trick for Distances
A method is described which, like the kernel trick in support vector machines (SVMs), lets us generalize distance-based algorithms to operate in feature spaces, usually nonlinearl...
Bernhard Schölkopf
CORR
2008
Springer
100views Education» more  CORR 2008»
15 years 3 months ago
Learning Isometric Separation Maps
Maximum Variance Unfolding (MVU) and its variants have been very successful in embedding data-manifolds in lower dimensionality spaces, often revealing the true intrinsic dimensio...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
JMLR
2006
123views more  JMLR 2006»
15 years 3 months ago
Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies
In this paper, we propose a number of adaptive prototype learning (APL) algorithms. They employ the same algorithmic scheme to determine the number and location of prototypes, but...
Fu Chang, Chin-Chin Lin, Chi-Jen Lu
JMLR
2006
89views more  JMLR 2006»
15 years 3 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel