Sciweavers

591 search results - page 32 / 119
» An Efficient Algorithm for Local Distance Metric Learning
Sort
View
ECCC
2007
180views more  ECCC 2007»
14 years 9 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
MLDM
2005
Springer
15 years 3 months ago
Using Clustering to Learn Distance Functions for Supervised Similarity Assessment
Assessing the similarity between objects is a prerequisite for many data mining techniques. This paper introduces a novel approach to learn distance functions that maximizes the c...
Christoph F. Eick, Alain Rouhana, Abraham Bagherje...
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
AAAI
1998
14 years 11 months ago
Integrating Topological and Metric Maps for Mobile Robot Navigation: A Statistical Approach
The problem of concurrent mapping and localization has received considerable attention in the mobile robotics community. Existing approachescan largely be grouped into two distinc...
Sebastian Thrun, Jens-Steffen Gutmann, Dieter Fox,...
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
15 years 2 months ago
On the Locality of Representations
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
Franz Rothlauf