567 search results - page 24 / 114 » Distance Learning for Similarity Estimation |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
65
Voted
ICRA
2007
IEEE
15 years 4 months ago
2007
IEEE
— This paper presents a vision-based approach to SLAM in large-scale environments with minimal sensing and computational requirements. The approach is based on a graphical repres...
ADC
1999
Springer
15 years 1 months ago
1999
Springer
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
101
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We present a polytope-kernel density estimation (PKDE) methodology that allows us to perform exact mean-shift updates along the edges of the Delaunay graph of the data. We discuss...
81
Voted
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Inverse reinforcement learning addresses the general problem of recovering a reward function from samples of a policy provided by an expert/demonstrator. In this paper, w...