888 search results - page 164 / 178 » Learning to Select a Ranking Function |
NIPS
2001
13 years 9 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We describe a framework for detecting and tracking continuous ”trails” in images and image sequences for autonomous robot navigation. Continuous trails are extended...
ACCV
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...