Sciweavers

567 search results - page 24 / 114
» Distance Learning for Similarity Estimation
Sort
View
KDD
2004
ACM
182views Data Mining» more  KDD 2004»
14 years 8 months ago
Rotation invariant distance measures for trajectories
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...
Michail Vlachos, Dimitrios Gunopulos, Gautam Das
ICRA
2007
IEEE
158views Robotics» more  ICRA 2007»
14 years 2 months ago
Mini-SLAM: Minimalistic Visual SLAM in Large-Scale Environments Based on a New Interpretation of Image Similarity
— 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...
Henrik Andreasson, Tom Duckett, Achim J. Lilientha...
ADC
1999
Springer
68views Database» more  ADC 1999»
13 years 12 months ago
A Query-sensitive Cost Model for Similarity Queries with M-tree
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 ...
Paolo Ciaccia, A. Nanni, Marco Patella
ICASSP
2011
IEEE
12 years 11 months ago
Polytope kernel density estimates on Delaunay graphs
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...
Erhan Bas, Deniz Erdogmus
PKDD
2009
Springer
181views Data Mining» more  PKDD 2009»
14 years 2 months ago
Active Learning for Reward Estimation in Inverse Reinforcement Learning
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...
Manuel Lopes, Francisco S. Melo, Luis Montesano