Sciweavers

2033 search results - page 187 / 407
» Support Vector Committee Machines
Sort
View
ECML
2006
Springer
14 years 1 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
ECML
2006
Springer
14 years 1 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
13 years 11 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
ML
2002
ACM
146views Machine Learning» more  ML 2002»
13 years 9 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
ICMLA
2010
13 years 7 months ago
An All-at-once Unimodal SVM Approach for Ordinal Classification
Abstract--Support vector machines (SVMs) were initially proposed to solve problems with two classes. Despite the myriad of schemes for multiclassification with SVMs proposed since ...
Joaquim F. Pinto da Costa, Ricardo Sousa, Jaime S....