Sciweavers

886 search results - page 16 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
ICML
2005
IEEE
14 years 10 months ago
High speed obstacle avoidance using monocular vision and reinforcement learning
We consider the task of driving a remote control car at high speeds through unstructured outdoor environments. We present an approach in which supervised learning is first used to...
Jeff Michels, Ashutosh Saxena, Andrew Y. Ng
ICML
2007
IEEE
14 years 10 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
APAL
2008
104views more  APAL 2008»
13 years 9 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
JCSS
2007
85views more  JCSS 2007»
13 years 9 months ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...