483 search results - page 52 / 97 » Linear Ranking with Reachability |
113
click to vote
ICML
2006
IEEE
16 years 4 months ago
2006
IEEE
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...
118
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
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...
106
click to vote
LREC
2008
15 years 5 months ago
2008
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...
151
click to vote
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
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...
165
click to vote
ICANN
2009
Springer
15 years 1 months ago
2009
Springer
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...