Sciweavers

2031 search results - page 188 / 407
» Oblique Support Vector Machines
Sort
View
ECML
2004
Springer
15 years 7 months ago
Multi-level Boundary Classification for Information Extraction
Abstract. We investigate the application of classification techniques to the problem of information extraction (IE). In particular we use support vector machines and several differ...
Aidan Finn, Nicholas Kushmerick
ECML
2006
Springer
15 years 7 months ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
122
Voted
ECML
2006
Springer
15 years 7 months ago
Evaluating Feature Selection for SVMs in High Dimensions
We perform a systematic evaluation of feature selection (FS) methods for support vector machines (SVMs) using simulated high-dimensional data (up to 5000 dimensions). Several findi...
Roland Nilsson, José M. Peña, Johan ...
LWA
2008
15 years 5 months ago
Determining the Polarity of Postings for Discussion Search
When performing discussion search it might be desirable to consider non-topical measures like the number of positive and negative replies to a posting, for instance as one possibl...
Ingo Frommholz, Marc Lechtenfeld
133
Voted
ML
2002
ACM
146views Machine Learning» more  ML 2002»
15 years 3 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio