1393 search results - page 208 / 279 » Machine Learning by Function Decomposition |
146
click to vote
MLMI
2007
Springer
16 years 9 days ago
2007
Springer
This paper outlines first the BET method for task-based evaluation of meeting browsers. ‘Observations of interest’ in meetings are empirically determined by neutral observers ...
160
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
147
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
174
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
152
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Clustering is a central unsupervised learning task with a wide variety of applications. Not surprisingly, there exist many clustering algorithms. However, unlike classification ta...