Sciweavers

318 search results - page 9 / 64
» Learning subspace kernels for classification
Sort
View
ICML
2010
IEEE
13 years 8 months ago
Projection Penalties: Dimension Reduction without Loss
Dimension reduction is popular for learning predictive models in high-dimensional spaces. It can highlight the relevant part of the feature space and avoid the curse of dimensiona...
Yi Zhang 0010, Jeff Schneider
GFKL
2007
Springer
164views Data Mining» more  GFKL 2007»
13 years 11 months ago
Classification with Invariant Distance Substitution Kernels
Kernel methods offer a flexible toolbox for pattern analysis and machine learning. A general class of kernel functions which incorporates known pattern invariances are invariant d...
Bernard Haasdonk, Hans Burkhardt
EACL
2006
ACL Anthology
13 years 9 months ago
Making Tree Kernels Practical for Natural Language Learning
In recent years tree kernels have been proposed for the automatic learning of natural language applications. Unfortunately, they show (a) an inherent super linear complexity and (...
Alessandro Moschitti
EVOW
2008
Springer
13 years 9 months ago
A Hybrid Random Subspace Classifier Fusion Approach for Protein Mass Spectra Classification
Classifier fusion strategies have shown great potential to enhance the performance of pattern recognition systems. There is an agreement among researchers in classifier combination...
Amin Assareh, Mohammad Hassan Moradi, L. Gwenn Vol...
ECML
2006
Springer
13 years 11 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