2033 search results - page 107 / 407 » Ranking on Data Manifolds |
267
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
156
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
168
click to vote
NIPS
2007
15 years 8 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
175
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
The Gaussian process latent variable model (GP-LVM) is a powerful approach for probabilistic modelling of high dimensional data through dimensional reduction. In this paper we ext...
170
click to vote
IVC
2007
15 years 6 months ago
2007
The problem of clustering is often addressed with techniques based on a Voronoi partition of the data space. Vector quantization is based on a similar principle, but it is a diffe...