Sciweavers

1015 search results - page 165 / 203
» Kernels for Multi--task Learning
Sort
View
EMNLP
2006
13 years 9 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
ICML
2010
IEEE
13 years 9 months ago
An Analysis of the Convergence of Graph Laplacians
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
Daniel Ting, Ling Huang, Michael I. Jordan
PR
2010
163views more  PR 2010»
13 years 6 months ago
Optimal feature selection for support vector machines
Selecting relevant features for Support Vector Machine (SVM) classifiers is important for a variety of reasons such as generalization performance, computational efficiency, and ...
Minh Hoai Nguyen, Fernando De la Torre
TNN
2011
200views more  TNN 2011»
13 years 3 months ago
Domain Adaptation via Transfer Component Analysis
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
Sinno Jialin Pan, Ivor W. Tsang, James T. Kwok, Qi...
ESANN
2006
13 years 9 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...