3718 search results - page 617 / 744 » On learning with dissimilarity functions |
158
click to vote
CIDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—This paper addresses two main challenges for clustering which require extensive human effort: selecting appropriate parameters for an arbitrary clustering algorithm and identify...
171
click to vote
COLT
2005
Springer
15 years 7 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
131
click to vote
COLT
2008
Springer
15 years 7 months ago
2008
Springer
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
155
click to vote
FLAIRS
2004
15 years 7 months ago
2004
We present results from experiments in using several pitch representations for jazz-oriented musical tasks performed by a recurrent neural network. We have run experiments with se...
182
Voted
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...