Sciweavers

483 search results - page 52 / 97
» Linear Ranking with Reachability
Sort
View
ICML
2006
IEEE
14 years 10 months ago
Learning low-rank kernel matrices
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
Brian Kulis, Inderjit S. Dhillon, Máty&aacu...
ICML
2005
IEEE
14 years 10 months ago
Predictive low-rank decomposition for kernel methods
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
Francis R. Bach, Michael I. Jordan
LREC
2008
126views Education» more  LREC 2008»
13 years 11 months ago
Tree Distance and Some Other Variants of Evalb
Some alternatives to the standard evalb measures for parser evaluation are considered, principally the use of a tree-distance measure, which assigns a score to a linearity and anc...
Martin Emms
PKDD
2010
Springer
169views Data Mining» more  PKDD 2010»
13 years 7 months ago
Classification with Sums of Separable Functions
Abstract. We present a novel approach for classification using a discretised function representation which is independent of the data locations. We construct the classifier as a su...
Jochen Garcke
ICANN
2009
Springer
13 years 7 months ago
MINLIP: Efficient Learning of Transformation Models
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
Vanya Van Belle, Kristiaan Pelckmans, Johan A. K. ...