Michael Fink

Learn More
We describe a framework for learning an object classifier from a single example, by emphasizing relevant dimensions using available examples of related classes. Learning to accurately classify objects from a single training example is often unfeasible due to overfitting effects. However, if the instance representation provides that the distance between each(More)
In this paper we learn heuristic functions that efficiently find the shortest path between two nodes in a graph. We rely on the fact that often, several elementary admissible heuristics might be provided , either by human designers or from formal domain abstractions. These simple heuris-tics are traditionally composed into a new admissible heuristic by(More)
  • 1