1393 search results - page 114 / 279 » Machine Learning by Function Decomposition |
95
Voted
ALT
2002
Springer
15 years 10 months ago
2002
Springer
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive ...
112
Voted
NIPS
2007
15 years 3 months ago
2007
We present a novel linear clustering framework (DIFFRAC) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The...
115
Voted
ECML
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...
121
click to vote
IROS
2009
IEEE
15 years 8 months ago
2009
IEEE
— When children learn to grasp a new object, they often know several possible grasping points from observing a parent’s demonstration and subsequently learn better grasps by tr...
ALT
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...