1605 search results - page 124 / 321 » Metric Learning to Rank |
165
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
We have developed a technique to characterize software developers' styles using a set of source code metrics. This style fingerprint can be used to identify the likely author...
132
click to vote
DA
2010
15 years 6 days ago
2010
We consider the Bayesian ranking and selection problem, in which one wishes to allocate an information collection budget as efficiently as possible to choose the best among severa...
113
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
135
click to vote
IOR
2011
14 years 10 months ago
2011
We derive a knowledge gradient policy for an optimal learning problem on a graph, in which we use sequential measurements to refine Bayesian estimates of individual edge values i...
158
Voted
BMCBI
2011
14 years 7 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...